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
On Logic Program Semantics with Two Kinds of Negation.
TL;DR: The goal of this paper is to contrast a variety of these semantics in what concerns their use and meaning of :-negation, and its relation to classical negation and to the default negation of normal programs, here denoted by not.
Book ChapterDOI
Logic-based knowledge representation
TL;DR: Descriptive Logics, Modallogics, and Nonmonotonic Logics are introduced as formalisms for representing terminological knowledge, time-dependent or subjective knowledge, and incomplete knowledge respectively.
Journal ArticleDOI
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
TL;DR: A new fixpoint semantics for logic programs with negation is studied, which is intermediate between Van Gelder's well-founded model and Gelfond and Lifschitz's stable model semantics and relates also to Doyle’s truth maintenance system and some implementations of rule-based expert systems.
Journal ArticleDOI
An overview of nonmonotonic reasoning and logic programming
TL;DR: The prehistory of nonmonotonic reasoning, starting from approximately 1958, is discussed and the major results developed, including complexity results that are known about the various theories, are reviewed.
Book ChapterDOI
Web Rules Need Two Kinds of Negation
TL;DR: This paper argues that, like in several basic computational languages, such as OCL and SQL, two kinds of negation are also needed for a Web rule language.