Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the decidability and complexity of integrating ontologies and rules
Web Semantics: Science, Services and Agents on the World Wide Web
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On representational issues about combinations of classical theories with nonmonotonic rules
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Semantic and computational advantages of the safe integration of ontologies and rules
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
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
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
FO(ID) as an Extension of DL with Rules
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
A Revised Concept of Safety for General Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Reconciling description logics and rules
Journal of the ACM (JACM)
Answer set programming for the semantic web
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Loop formulas for description logic programs
Theory and Practice of Logic Programming
FO(ID) as an extension of DL with rules
Annals of Mathematics and Artificial Intelligence
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
Theory and Practice of Logic Programming
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
The loop formula based semantics of description logic programs
Theoretical Computer Science
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
Simulating production rules using ACTHEX
Correct Reasoning
RDL: enhancing description logic with rules
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Eliminating nonmonotonic DL-Atoms in description logic programs
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
In the ongoing discussion about combining rules and Ontologies on the Semantic Web a recurring issue is how to combine first-order classical logic with nonmonotonic rule languages. Whereas several modular approaches to define a combined semantics for such hybrid knowledge bases focus mainly on decidability issues, we tackle the matter from a more general point of view. In this paper we show how Quantified Equilibrium Logic (QEL) can function as a unified framework which embraces classical logic as well as disjunctive logic programs under the (open) answer set semantics. In the proposed variant of QEL we relax the unique names assumption, which was present in earlier versions of QEL. Moreover, we show that this framework elegantly captures the existing modular approaches for hybrid knowledge bases in a unified way.