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
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Annals of Mathematics and Artificial Intelligence
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conservative extensions in expressive description logics
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
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
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
Theory and Practice of Logic Programming
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
Integrating rules and ontologies in the first-order stable model semantics
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
The loop formula based semantics of description logic programs
Theoretical Computer Science
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Semantic independence in DL-programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
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 |
We present a new semantics for Description Logic programs [1] (dl-programs) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a foundation for ordinary logic programs under answer set semantics and removes the need for program reducts. Here we extend the concept of QHT-model to encompass dl-programs. As an application we characterise some logical relations between dl-programs, by mating the idea of QHT-equivalence with the concept of query inseparability taken from description logics.