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.
|Number of pages||21|
|Journal||Annals of Mathematics and Artificial Intelligence|
|State||Published - Dec 2006|
Bibliographical noteFunding Information:
This work was partially supported by the NSF grant IIS-0325063.
- Autoepistemic logic
- Default logic
- Nonmonotonic theories
ASJC Scopus subject areas
- Artificial Intelligence
- Applied Mathematics