Integrating Inductive Definitions in SAT

DOI10.1007/978-3-540-75560-9_28zbMath1137.68581OpenAlexW1552768819MaRDI QIDQ3498482

Marc Denecker, Maarten Mariën, Johan Wittocx

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

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

• ASSAT

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

This page was built for publication: Integrating Inductive Definitions in SAT