Open AccessProceedings Article
Logic programs with classical negation
Michael Gelfond,Vladimir Lifschitz +1 more
- pp 579-597
Reads0
Chats0
About:
This article is published in International Conference on Lightning Protection.The article was published on 1990-05-01 and is currently open access. It has received 602 citations till now. The article focuses on the topics: Negation & Predicate functor logic.read more
Citations
More filters
Book ChapterDOI
Generalizing Updates: From Models to Programs
João Leite,Luís Moniz Pereira +1 more
TL;DR: This paper advocates that the principle of inertia is advan- tageously applied to the rules of the initial program rather than to the individual literals in a model, and shows how this concept of pro- gram update generalizes model or interpretation updates.
Book ChapterDOI
On Open Defaults
TL;DR: This work proposes an alternative definition of an extension for a default theory, which handles parameters as genuine object variables, and may be preferable when the domain closure assumption is not postulated.
Book ChapterDOI
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
TL;DR: In this article, a new proof procedure for abductive logic programming is presented, which extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and relaxing the restrictions on allowed inputs for which the procedure can operate correctly.
Journal ArticleDOI
Inquire Biology: A Textbook that Answers Questions
Vinay K. Chaudhri,Britte Haugan Cheng,Adam Overtholtzer,Jeremy Roschelle,Aaron Spaulding,Peter Clark,Mark Greaves,Dave Gunning +7 more
TL;DR: The initial prototype of Inquire Biology provides unique capabilities via a knowledge representation that captures conceptual knowledge from the textbook and uses inference procedures to answer students’ questions.
Proceedings Article
Hypothetical Reasoning with Well Founded Semantics.
TL;DR: The original contributions of this paper are: showing that Well Founded Semantics is useful for representing hypothetical reasoning problems; to present a framework for representing always within the language itself: definite, default and generally applicable rules; preference among defaults; exceptions to rules; exception to exceptions; abduction; and integrity constraints.