Programming in autoepistemic logic

Authors:
Kienchung Kuo
Affiliations:
Department of Computer Science, SUNY at Stony Brook, Stony Brook, NY
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Year:
1991

Citing 10
Cited 0

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Negation in logic programming

Journal of Logic Programming
On the relation between default and autoepistemic logic

Artificial Intelligence
SYGRAF: Implementing Logic Programs in a Database Style

IEEE Transactions on Software Engineering
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On the declarative and procedual semantics of logic programs

Journal of Automated Reasoning
A procedural semantics for well founded negation in logic programs

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programs with classical negation

Logic programming
Relating autoepistemic and default logics

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a language for programming in autoepistemic logic that extends the standard logic programming and incorporates incomplete information. By syntactically distinguishing the "true negation" from the "lack of information," we also provide a way to define negative information explicitly. A fixpoint semantics can be defined for stratified and conservative programs. In this paper, we investigate definite autoepistemic programs. We investigate fixpoints of definite autoepistemic programs and show that they coincide with the declarative semantics of these programs. We also define a resolution procedure, called SLSAE-resolution, for such programs. SLSAE-resolution is sound and complete for stratified, conservative, and solvable programs.