Alternating fixed points in Boolean equation systems as preferred stable models

DOI10.1007/3-540-45635-X_23MaRDI QIDQ4736515zbMATH OpenFDO

Authors K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2237/22370227.htm

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• The alternating fixpoint of logic programs with negation
• Analysis of Boolean equation systems through structure graphs
• On the equivalence of semantics for normal logic programs
• Parameterised Boolean equation systems

Cited in

(3)

• Oscillating behavior of logic programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems

This page was built for publication: Alternating fixed points in Boolean equation systems as preferred stable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736515)