Combining Horn rules and description logics in CARIN

From MaRDI portal
Publication:1274681

DOI10.1016/S0004-3702(98)00048-4zbMath0908.68166OpenAlexW2059572645MaRDI QIDQ1274681

Marie-Christine Rousset, Alon Y. Halevy

Publication date: 12 January 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00048-4




Related Items (20)

Representing ontologies using description logics, description graphs, and rulesCombining answer set programming with description logics for the semantic webOn the relation between SPARQL1.1 and Answer Set ProgrammingConjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knotsExtended RDF: computability and complexity issuesOntology-Mediated Query Answering with Data-Tractable Description LogicsLocal closed world reasoning with description logics under the well-founded semanticsFoundations of Onto-Relational LearningTractable reasoning and efficient query answering in description logics: The DL-Lite familyData complexity of query answering in expressive description logics via tableauxReasoning and Query Answering in Description LogicsAnswering regular path queries in expressive description logics via alternating tree-automataThe role of semantics in mining frequent patterns from knowledge bases in description logics with rulesInductive Logic Programming in Databases: From <scp>Datalog</scp> toA hybrid reasoning system for terminologies and first-order clauses in knowledge basesProbabilistic description logic programsMethods and algorithms for verification of knowledge bases in integrated expert systemsTightly Coupled Probabilistic Description Logic Programs for the Semantic WebQuery Answering with DBoxes is HardCombining Description Logics, Description Graphs, and Rules



Cites Work


This page was built for publication: Combining Horn rules and description logics in CARIN