Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

47

WLP
2004
Springer

favoriteEmaildiscussreport

141views Artificial Intelligence» more WLP 2004»

Solving Alternating Boolean Equation Systems in Answer Set Programming

14 years 2 months ago

Solving Alternating Boolean Equation Systems in Answer Set Programming

Download www.tcs.hut.fi

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 ﬁxed 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.

Misa Keinänen, Ilkka Niemelä

Real-time Traffic

Boolean Equation Systems | Check Alternating Formulas | Conjunctive Boolean Equation | WLP 2004 |

claim paper

Related Content

» Modelling gene and protein regulatory networks with Answer Set Programming

» Narrowing Approximations as an Optimization for Equational Logic Programs

» Distributed Local Resolution of Boolean Equation Systems

» Solving Hard Disjunctive Logic Programs Faster Sometimes

» A PseudoBoolean Solution to the Maximum Quartet Consistency Problem

» Contracts as Pairs of Projections

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WLP
Authors	Misa Keinänen, Ilkka Niemelä

Comments (0)