Strong and uniform equivalence of nonmonotonic theories – an algebraic approach

Mirosław Truszczyński
2007 Annals of Mathematics and Artificial Intelligence  
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.
doi:10.1007/s10472-007-9049-2 fatcat:wresng47vrdh3ivwwoefsst6gy