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
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Partial matchmaking using approximate subsumption
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Representing causal information about a probabilistic process
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper presents a Knowledge Base project for FO(ID), an extension of classical logic with inductive definitions. This logic is a natural integration of classical logic and logic programming based on the view of a logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities and striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive with the best ASP-solvers.