Integrating Inductive Definitions in SAT
From MaRDI portal
Publication:3498482
DOI10.1007/978-3-540-75560-9_28zbMath1137.68581MaRDI QIDQ3498482
Marc Denecker, Johan Wittocx, Maarten Mariën
Publication date: 15 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_28
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68N17: Logic programming
Related Items
Integrating Inductive Definitions in SAT, SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- ASSAT: computing answer sets of a logic program by SAT solvers
- Integrating Inductive Definitions in SAT
- The well-founded semantics for general logic programs
- Why are there so many loop formulas?
- Theory and Applications of Satisfiability Testing
- Satisfiability Checking for PC(ID)
- Logic Programming and Nonmonotonic Reasoning
- Conflict-Driven Answer Set Enumeration
- Logic Programming