Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning

Authors:
Marc Denecker;Victor Marek;Miroslaw Truszczyński
Affiliations:
Department of Computer Science, Heverlee, Belgium;Univ. of Kentucky, Lexington;Univ. of Kentucky, Lexington
Venue:
Logic-based artificial intelligence
Year:
2000

Citing 9
Cited 3

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Possible-world semantics for autoepistemic logic

Readings in nonmonotonic reasoning
On the relation between default and autoepistemic logic

Artificial Intelligence
Negation by default and unstratifiable logic programs

Selected papers of the workshop on Deductive database theory
Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Relating autoepistemic and default logics

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Fixpoint 3-valued semantics for autoepistemic logic

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Fixpoint semantics for logic programming a survey

Theoretical Computer Science

Uniform semantic treatment of default and autoepistemic logics

Artificial Intelligence
Epistemic foundation of stable model semantics

Theory and Practice of Logic Programming
Predicate introduction under stable and well-founded semantics

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operati