Meta-logic programming for the extensions of default theories

Authors:
Masahiko Arai
Affiliations:
Tokai University, Numazu, Shizuoka, Japan
Venue:
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Year:
2007

Citing 3
Cited 0

A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Stable model checking made easy

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic programming is given for the extensions of default theories such that the consequent of a default is a clause and the prerequisite is the conjunction of clauses. The default theories include both the classical negation and the not symbol. Meta-logic programs and the resolution-trees are presented for the extensions. It is shown that a clause is in an extension iff the resolution-tree for the clause given by the meta-logic program includes the empty node similarly to in Prolog. However the extension isn't equal to the set of clauses obtained from the least model of the meta-logic program. The extension includes the set.