Strong and uniform equivalence of nonmonotonic theories - an algebraic approach

We show that the concepts of strong and uniform equivalence of logic programs eneralized 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.

• Type: Journal
• Year: 2006
• Where: AMAI
• Authors: Miroslaw Truszczynski
• Keywords: Abstract Algebraic Setting, AMAI 2006, Artificial Intelligence, Logic, Uniform Equivalence