Minimal belief and negation as failure: a feasible approach

Authors:
Antje Beringer;Torsten Schaub
Affiliations:
FG Intellektik, TH Darmstadt, Darmstadt, Germany;FG Intellektik, TH Darmstadt, Darmstadt, Germany
Venue:
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Year:
1993

Citing 5
Cited 0

Foundations of a functional approach to knowledge representation.

Artificial Intelligence
Logic programs with classical negation

Logic programming
SETHEO: a high-performance theorem prover

Journal of Automated Reasoning
Epistemic semantics for fixed-points non-monotonic logics

TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Nonmonotonic databases and epistemic queries

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lifschitz introduced a logic of minimal belief and negation as failure, called MBNF, in order to provide a theory of epistemic queries to non monotonic databases. We present a feasible subsystem of MBNF which can be translated into a logic built on first order logic and negation as failure, called FONF. We give a semantics for FONF along with an extended connection calculus. In particular, we demonstrate that the obtained system is still more expressive than other approaches.