ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Strong Equivalence for Logic Programs and Default Theories (Made Easy)
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The USA-Advisor: A Case Study in Answer Set Planning
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Diagnostic reasoning with A-Prolog
Theory and Practice of Logic Programming
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Interpolation and Definability in Modal Logics (Oxford Logic Guides)
Interpolation and Definability in Modal Logics (Oxford Logic Guides)
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Annals of Mathematics and Artificial Intelligence
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Safe Formulas in the General Theory of Stable Models (Preliminary Report)
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
System f2lp --- Computing Answer Sets of First-Order Formulas
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Quantified equilibrium logic and hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An implementation for recognizing rule replacements in non-ground answer-set programs
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Even within a single knowledge representation system there are often many different ways to model a given domain and formalise a reasoning problem specified over the domain. In particular, two knowledge descriptions can be semantically equivalent even if they are expressed in quite different languages or vocabularies. This paper proposes and studies a concept of synonymy that applies to equivalent theories formulated in distinct vocabularies. We suggest a set of general desiderata or criteria of adequacy that any reasonable synonymy concept should satisfy. We then analyse a specific concept of synonymy within answer set programming (ASP), a framework that is currently being applied with success in many areas of knowledge technology. We characterise this concept in different ways, show that it satisfies the prescribed criteria of adequacy, and illustrate how it can be applied to a sample problem arising in knowledge representation and reasoning. As a logical framework we use quantified equilibrium logic based on a first-order version of the logic of here-and-there. This serves as an adequate formal foundation for ASP and allows us to obtain a logical account of the synonymy relation.