Semantical considerations on nonmonotonic logic
Artificial Intelligence
OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Arithmetic classification of perfect models of stratified programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Bilattices and the semantics of logic programming
Journal of Logic Programming
Journal of Computer and System Sciences
Journal of the ACM (JACM)
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
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Topological characterizations for logic programming semantics
Topological characterizations for logic programming semantics
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Proceedings of the 1999 international conference on Logic programming
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Knowledge Representation: An AI Perspective
Knowledge Representation: An AI Perspective
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A Terminological Interpretation of (Abductive) Logic Programming
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Information and Computation
Minimum model semantics for logic programs with negation-as-failure
ACM Transactions on Computational Logic (TOCL)
Epistemic foundation of stable model semantics
Theory and Practice of Logic Programming
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Artificial Intelligence
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
ICLP '08 Proceedings of the 24th 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
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
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
Knowledge representation and non-monotonic reasoning
A 25-year perspective on logic programming
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
An ID-logic formalization of the composition of autonomous databases
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
An algebraic account of modularity in ID-logic
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
Annals of Mathematics and Artificial Intelligence
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.01 |
Logic programming has been introduced as programming in the Horn clause subset of first-order logic. This view breaks down for the negation as failure inference rule. To overcome the problem, one line of research has been to view a logic program as a set of iff-definitions. A second approach was to identify a unique canonical, preferred, or intended model among the models of the program and to appeal to common sense to validate the choice of such model. Another line of research developed the view of logic programming as a nonmonotonic reasoning formalism strongly related to Default Logic and Autoepistemic Logic. These competing approaches have resulted in some confusion about the declarative meaning of logic programming. This paper investigates the problem and proposes an alternative epistemological foundation for the canonical model approach, which is not based on common sense but on a solid mathematical information principle. The thesis is developed that logic programming can be understood as a natural and general logic of inductive definitions. In particular, logic programs with negation represent nonmonotone inductive definitions. It is argued that this thesis results in an alternative justification of the well-founded model as the unique intended model of the logic program. In addition, it equips logic programs with an easy-to-comprehend meaning that corresponds very well with the intuitions of programmers.