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
Chapter 6 Nonmonotonic Reasoning
TL;DR: This chapter discusses Commonsense reasoning, which has been a focus of extensive studies by the knowledge representation community since the early eighties of the past century and was fueled by several fundamental challenges facing knowledge representation such as modeling and reasoning about rules with exceptions or defaults and solving the frame problem.
Book ChapterDOI
On the Relationship between Defeasible Logic and Well-Founded Semantics
TL;DR: It turns out that a slightly restricted version of defeasible logic is correct wrt well-founded semantics yet incomplete, and it is argued that the additional conclusions obtained by prioritized well- founded semantics are indeed desired.
Proceedings ArticleDOI
Distributed diagnosis by vivid agents
Michael Schroeder,Gerd Wagner +1 more
TL;DR: This article introduces a meta-logic interpreter for vivid agents which allows to develop distributed monitoring and diagnosis systems consisting of a variety of scalable knowledge-and perception-based agents.
Posted Content
Query-driven Procedures for Hybrid MKNF Knowledge Bases
TL;DR: In this paper, the authors define a general query-driven procedure for Hybrid MKNF that is sound with respect to the stable model-based semantics, and sound and complete in respect to its well-founded semantics.
Book ChapterDOI
A Terminological Interpretation of (Abductive) Logic Programming
TL;DR: This paper extends the logic program formalism such that some predicates can be left undefined and use classical logic as the language for the ABox and study the expressivity of the formalism for representing uncertainty by proposing solutions for problems in temporal reasoning, with null values and open domain knowledge.