Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Answering regular path queries in expressive description logics: an automata-theoretic approach
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Conjunctive query answering for the description logic SHIQ
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
Reducing OWL entailment to description logic satisfiability
Web Semantics: Science, Services and Agents on the World Wide Web
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
Quantified equilibrium logic and hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
The limits of querying ontologies
ICDT'07 Proceedings of the 11th international conference on Database Theory
A comparison of reasoning techniques for querying large description logic ABoxes
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and 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
Can OWL and logic programming live together happily ever after?
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Realizing Default Logic over Description Logic Knowledge Bases
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Fusion of Logic Programming and Description Logics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Well-founded semantics for description logic programs in the semantic web
ACM Transactions on Computational Logic (TOCL)
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Pushing efficient evaluation of HEX programs by modular decomposition
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Dealing with inconsistency when combining ontologies and rules using DL-Programs
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Semantic independence in DL-programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Conflict-driven asp solving with external sources
Theory and Practice of Logic Programming
Data repair of inconsistent DL-programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.