Abstract
We study two methods for non-monotonic reasoning within amalgamated logic programming. One approach extends Bowen and Kowalski's consistency checking method with an eplstemic interpretation for consistency, The other is to simulate Levesque's logic of All I Know(OL) for realizing non-monotonic provability. We show the representations of autoepistemic reasoning in these methods.
Cite
CITATION STYLE
Akama, S. (1991). Amalgamated logic programming and non-monotonic reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 542 LNAI Part F2, pp. 450–458). Springer Verlag. https://doi.org/10.1007/3-540-54563-8_108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
