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
Formalizing common sense reasoning for scalable inconsistency-robust information coordination using Direct Logic™ Reasoning and the Actor Model
TL;DR: Using the Actor Model, this paper proves that Logic Programming is not computationally universal in that there are computations that cannot be implemented using logical inference, strictly less general than the Procedural Embedding of Knowledge paradigm.
Hypothetical reasoning with well founded semantics
TL;DR: In this article, Pereira et al. show that well-founded semantics is useful for representing hypothetical reasoning problems and present a framework for representing always within the language itself: definite, default and generally applicable rules; preference among defaults, exceptions to rules; exceptions to exceptions; abduction; and integrity constraints.
Posted Content
Formalizing common sense for scalable inconsistency-robust information integration using Direct Logic(TM) reasoning and the Actor Model
TL;DR: Using the Actor Model, this paper proves that Logic Programming is not computationally universal in that there are computations that cannot be implemented using logical inference, strictly less general than the Procedural Embedding of Knowledge paradigm.
Proceedings Article
A knowledge representation framework based on autoepistemic logic of minimal beliefs
TL;DR: A simple non-monotonic knowledge representation framework which isomorphically contains all of the above mentioned non monotonic formalisms and semantics as special cases and yet is significantly more expressive than each one of these formalisms considered individually.
Book ChapterDOI
An Argumentation Theoretic Semantics Based on Non-Refutable Falsity
TL;DR: It is argued that the well-founded semantics (WFS), for normal program, and similarly the well -founded semantics with explicit negation (W FSX), for extended ones are, by design, overly careful in deciding about the falsity of some atoms, by leaving them undefined.