A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Strong and uniform equivalence of nonmonotonic theories – an algebraic approach
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