Meta-Logic Programming for the Extensions of Default Theories

M. Arai (Japan)


Artificial intelligence, nonmonotonic logic, default logic, logic programming, and meta-logic


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.

Important Links:

Go Back