On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Extended stable semantics for normal and disjunctive programs
Logic programming
Logic programming
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Artificial intelligence and mathematical theory of computation
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
Definability and commonsense reasoning
Artificial Intelligence
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Equality and Domain Closure in First-Order Databases
Journal of the ACM (JACM)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Knowledge Representation: An AI Perspective
Knowledge Representation: An AI Perspective
The Well-Founded Semantics Is the Principle of Inductive Definition
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Inductive Definability and the Situation Calculus
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
A Terminological Interpretation of (Abductive) Logic Programming
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
Abduction in Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
On the Transformation of Object-Oriented Conceptual Models to Logical Theories
ER '02 Proceedings of the 21st International Conference on Conceptual Modeling
Automata and Answer Set Programming
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
Grounding FO and FO(ID) with bounds
Journal of Artificial Intelligence Research
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Reducing inductive definitions to propositional satisfiability
ICLP'05 Proceedings of the 21st international conference on Logic Programming
An ID-logic formalization of the composition of autonomous databases
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Satisfiability checking for PC(ID)
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Predicate introduction under stable and well-founded semantics
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Connecting first-order ASP and the logic FO(ID) through reducts
Correct Reasoning
A formal approach for inspecting privacy and trust in advanced electronic services
ESSoS'13 Proceedings of the 5th international conference on Engineering Secure Software and Systems
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.