Publisher Summary Modal mu-calculus is a logic used extensively in certain areas of
computer science and is of considerable intrinsic mathematical and logical interest. Its …

Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …

Logic programming with the stable model semantics is put forward as a novel constraint
programming paradigm. This paradigm is interesting because it bring advantages of logic …

A novel logic program like language, weight constraint rules, is developed for answer set
programming purposes. It generalizes normal logic programs by allowing weight constraints …

In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

Model-checking is a successful technique for automatically verifying concurrent finite-state
systems. When designing a model-checker, a good compromise must be made between the …

This article studies an implementation methodology for partial and disjunctive stable models
where partiality and disjunctions are unfolded from a logic program so that an …

We briefly survey the background and history of modal and temporal logics. We then
concentrate on the modal mu-calculus, a modal logic which subsumes most other commonly …

A rule-based language is proposed for product configuration applications. It is equipped with
a declarative semantics providing formal definitions for main concepts in product …

We present a novel framework for exploring very large state spaces of concurrent reactive
systems. Our framework exploits application-independent heuristics using genetic …