Programming in Autoepistemic Logic
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 884-888.
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. SLSAEresolution is sound and complete for stratified, conservative, and solvable programs .
@inproceedings{ijcai1991p130,
title = {Programming in Autoepistemic Logic},
author = {Kuo, Kienchung},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {884--888},
year = {1991},
month = {8},
note = {Logic Programming},
url = {https://ijcai.org/proceedings/1991/130},
}
TY - CPAPER TI - Programming in Autoepistemic Logic AU - Kuo, Kienchung T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 884 EP - 888 UR - https://ijcai.org/proceedings/1991/130 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
