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
Journal ArticleDOI
Strong equivalence made easy: nested expressions and weight constraints
TL;DR: This note considers a simpler, more direct characterization of strong equivalence for logic programs with nested expressions, and shows that it can also be applied without modification to the weight constraint programs of Niemelä and Simons.
Journal ArticleDOI
Representing actions in logic programs and default theories: A situation calculus approach
TL;DR: This work addresses the problem of representing common sense knowledge about action domains in the formalisms of logic programming and default logic by defining a high-level language for representing knowledge about actions, and specifying a translation from the high- level action language into a general-purpose formalism, such as logic programming.
Journal ArticleDOI
Well-founded semantics for extended logic programs with dynamic preferences
TL;DR: In this paper, an extension of well-founded semantics for logic programs with two types of negation is described, in which information about preferences between rules can be expressed in the logical language and derived dynamically.
Proceedings Article
An assumption-based framework for non-monotonic reasoning
TL;DR: The paper investigates applications of the framework to logic programming , abductive logic programming, logic programs extended with \classi-cal" negation, default logic, autoepistemic logic, and non-monotonic modal logic.
Posted Content
Strong Equivalence Made Easy: Nested Expressions and Weight Constraints
TL;DR: In this article, the authors consider a simpler, more direct characterization of strong equivalence for logic programs with nested expressions, and show that it can also be applied without modification to the weight constraint programs of Niemela and Simons.