SAT(ID): satisfiability of propositional logic extended with inductive definitions

Authors:
Maarten Mariën;Johan Wittocx;Marc Denecker;Maurice Bruynooghe
Affiliations:
Department of Computer Science, Katholieke Universiteit Leuven, Belgium;Department of Computer Science, Katholieke Universiteit Leuven, Belgium;Department of Computer Science, Katholieke Universiteit Leuven, Belgium;Department of Computer Science, Katholieke Universiteit Leuven, Belgium
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 17
Cited 10

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Justification semantics: a unifying framework for the semantics of logic programs

Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Software Abstractions: Logic, Language, and Analysis

Software Abstractions: Logic, Language, and Analysis
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
A framework for representing and solving NP search problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
The first answer set programming system competition

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Well-founded semantics and the algebraic theory of non-monotone inductive definitions

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Clasp: a conflict-driven answer set solver

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Integrating inductive definitions in SAT

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Reducing inductive definitions to propositional satisfiability

ICLP'05 Proceedings of the 21st international conference on Logic Programming
CMODELS: SAT-based disjunctive answer set solver

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Predicate introduction under stable and well-founded semantics

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Debugging for Model Expansion

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Deductive System for FO(ID) Based on Least Fixpoint Logic

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Implementing PS-Merge Operator

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Grounding FO and FO(ID) with bounds

Journal of Artificial Intelligence Research
Towards computing revised models for FO theories

INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Conflict-driven answer set solving: From theory to practice

Artificial Intelligence
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Connecting first-order ASP and the logic FO(ID) through reducts

Correct Reasoning
The multi-engine ASP solver ME-ASP

JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Relating constraint answer set programming languages and algorithms

Artificial Intelligence

Quantified Score

Hi-index	0.02

Visualization

Abstract

We investigate the satisfiability problem, SAT(ID), of an extension of propositional logic with inductive definitions. We demonstrate how to extend existing SAT solvers to become SAT(ID) solvers, and provide an implementation on top of MiniSat. We also report on a performance study, in which our implementation exhibits the expected benefits: full use of the underlying SAT solver's potential.