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
On finding the strongly connected components in a directed graph
Information Processing Letters
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
The Well-Founded Semantics Is the Principle of Inductive Definition
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing Well-founded Semantics Faster
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
On the Problem of Computing the Well-Founded Semantics
CL '00 Proceedings of the First International Conference on Computational Logic
Extending Classical Logic with Inductive Definitions
CL '00 Proceedings of the First International Conference on Computational Logic
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Reducing inductive definitions to propositional satisfiability
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Artificial Intelligence
Grounding for model expansion in k-guarded formulas with inductive definitions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
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
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MidL, experimentally validating our approach.