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
MWeb: A principled framework for modular web rule bases and its semantics
TL;DR: In this article, a principled framework for modular Web rule bases, called MWeb, is presented, where each predicate defined in a rule base is characterized by its defining reasoning mode, scope, and exporting rule base list.
Journal ArticleDOI
Autoepistemic logic of knowledge and beliefs
TL;DR: The proposed logic constitutes a powerful new formalism which can serve as a unifying frame-work for several major nonmonotonic formalisms, which allows to better understand mutual relationships existing between different formalisms and semantics and enables to provide them with simpler and more natural definitions.
Book ChapterDOI
An Abductive Proof Procedure for Reasoning About Actions in Modal Logic Programming
TL;DR: A modal language is introduced which makes use of abductive assumptions to deal with persistency, and provides a solution to the ramification problem, by allowing one-way “causal rules” to be defined among fluents.
Book ChapterDOI
Implementing query answering for hybrid MKNF knowledge bases
TL;DR: This paper provides algorithms to relate the entailments of the ontology and the inferences of rules, and describes the implementation of a query-driven system, CDF-Rules, for hybrid knowledge bases combining both (non-monotonic) rules under the well-founded semantics and a (monotony) ontology, represented by a CDF ($\mathcal{ALCQ}$) theory.
Journal ArticleDOI
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
TL;DR: It is shown that query-driven Hybrid MKNF preserves polynomial data complexity when using the EL+ oracle and WFS, and is sound with respect to the stable model-based semantics, and sound and complete withrespect to its WFS variant.