Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 245-265 |
| Number of pages | 21 |
| Journal | Annals of Mathematics and Artificial Intelligence |
| Volume | 48 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Dec 2006 |
Bibliographical note
Funding Information:This work was partially supported by the NSF grant IIS-0325063.
Funding
This work was partially supported by the NSF grant IIS-0325063.
| Funders | Funder number |
|---|---|
| U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China | IIS-0325063 |
| U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China |
Keywords
- Autoepistemic logic
- Default logic
- Nonmonotonic theories
ASJC Scopus subject areas
- Applied Mathematics
- Artificial Intelligence