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 |
|---|---|
| Title of host publication | Proceedings, 10th International Conference on Principles of Knowledge Representation and Reasoning, KR 2006 |
| Pages | 389-399 |
| Number of pages | 11 |
| State | Published - 2006 |
| Event | 10th International Conference on Principles of Knowledge Representation and Reasoning, KR 2006 - Lake District, United Kingdom Duration: Jun 2 2006 → Jun 5 2006 |
Publication series
| Name | Proceedings of the International Conference on Knowledge Representation and Reasoning |
|---|---|
| ISSN (Print) | 2334-1025 |
| ISSN (Electronic) | 2334-1033 |
Conference
| Conference | 10th International Conference on Principles of Knowledge Representation and Reasoning, KR 2006 |
|---|---|
| Country/Territory | United Kingdom |
| City | Lake District |
| Period | 6/2/06 → 6/5/06 |
Bibliographical note
Copyright:Copyright 2021 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Logic