Integrating Inductive Definitions in SAT

DOI10.1007/978-3-540-75560-9_28zbMATH Open1137.68581OpenAlexW1552768819MaRDI QIDQ3498482FDOQ3498482

Authors: Maarten Mariën, Johan Wittocx, Marc Denecker 

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

Recommendations

• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Logic Programming
• Satisfiability Checking for PC(ID)
• Temporal induction by incremental SAT solving
• A logic of fixpoint definitions

Mathematics Subject Classification ID

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

Cites Work

• Theory and Applications of Satisfiability Testing
• ASSAT: computing answer sets of a logic program by SAT solvers
• The well-founded semantics for general logic programs
• The alternating fixpoint of logic programs with negation
• Title not available (Why is that?)
• Conflict-Driven Answer Set Enumeration
• Title not available (Why is that?)
• Why are there so many loop formulas?
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Satisfiability Checking for PC(ID)
• Integrating Inductive Definitions in SAT

Cited In (4)

• Logic Programming
• Integrating Inductive Definitions in SAT
• Satisfiability Checking for PC(ID)
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions

Uses Software

• ASSAT

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

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