Affiliation:
1. Katholieke Univ. Leuven, Heverlee, Belgium
2. Univ. of Kentucky, Lexington
Abstract
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 uniquecanonical, preferred, orintendedmodel among the models of the program and to appeal tocommon senseto 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 thecanonical modelapproach, which is not based on common sense but on a solid mathematical information principle. The thesis is developed thatlogic 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference71 articles.
1. The Generalized Completeness of Horn Predicate Logic as a Programming Language;ANDREKA H.;Acta Cybernetica,1978
2. Logic programming and negation: A survey
3. Contributions to the Theory of Logic Programming
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献