SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions

DOI10.1007/978-3-540-79719-7_20zbMath1138.68547OpenAlexW1540443495MaRDI QIDQ3502709

Maurice Bruynooghe, Maarten Mariën, Marc Denecker, Johan Wittocx

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_20

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

On abstract modular inference systems and solvers, A Formal Theory of Justifications, The Design of the Sixth Answer Set Programming Competition, Connecting First-Order ASP and the Logic FO(ID) through Reducts, SAT solving for termination proofs with recursive path orders and dependency pairs, Debugging for Model Expansion, Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3, Design and results of the Fifth Answer Set Programming Competition, Relating constraint answer set programming languages and algorithms, Conflict-driven answer set solving: from theory to practice

Uses Software

• MiniSat

Cites Work

• The alternating fixpoint of logic programs with negation
• ASSAT: computing answer sets of a logic program by SAT solvers
• Solving SAT and SAT Modulo Theories
• Integrating Inductive Definitions in SAT
• The well-founded semantics for general logic programs
• GRASP: a search algorithm for propositional satisfiability
• Theory and Applications of Satisfiability Testing
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• Predicate Introduction Under Stable and Well-Founded Semantics
• Logic Programming
• A machine program for theorem-proving
• Unnamed Item
• Unnamed Item