Solving alternating boolean equation systems in answer set programming

Authors:
Misa Keinänen;Ilkka Niemelä
Affiliations:
Dept. of Computer Science and Engineering, Lab. for Theoretical Comp. Science, Helsinki University of Technology, HUT, Finland;Dept. of Computer Science and Engineering, Lab. for Theoretical Comp. Science, Helsinki University of Technology, HUT, Finland
Venue:
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Year:
2004

Citing 16
Cited 2

A linear algorithm to solve fixed-point equations on transition systems

Information Processing Letters
Model checking and boolean graphs

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
Answer set planning

Proceedings of the 1999 international conference on Logic programming
On model checking for the &mgr;-calculus and its fragments

Theoretical Computer Science
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On Model-Checking for Fragments of µ-Calculus

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models

Proceedings of the 17th International Conference on Logic Programming
Bounded LTL model checking with stable models

Theory and Practice of Logic Programming

Fo(fd): Extending classical logic with rule-based fixpoint definitions

Theory and Practice of Logic Programming
Solving parity games by a reduction to SAT

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system can be determined by the existence of a stable model of the corresponding logic program. The technique can be used to model check alternating formulas of modal μ-calculus.