Strong and Uniform Equivalence of Nonmonotonic Theories — An Algebraic Approach

Miroslaw Truszczynski

We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and uniform equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.

Subjects: 3.3 Nonmonotonic Reasoning; 9.3 Mathematical Foundations

Submitted: Mar 3, 2006


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.