Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

DOI10.1007/978-3-642-00685-2_4zbMath1246.68216OpenAlexW3021599317MaRDI QIDQ3638227

Heiner Stuckenschmidt, Andrea Calì, Livia Predoiu, Thomas Lukasiewicz

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00685-2_4

zbMATH Keywords

complexityalgorithmsinconsistency handlingdescription logicssemantic webdisjunctive logic programsweb servicesanswer set semanticsdata tractabilityontology mappingprobabilistic description logic programsBayesian probabilitiesmerging ontology mappings

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Internet topics (68M11)

Related Items (3)

Extending description logics with uncertainty reasoning in possibilistic logic ⋮ Tableau reasoning for description logics and its extension to probabilities ⋮ Tightly integrated probabilistic description logic programs for representing ontology mappings

Uses Software

• GOLOG
• swrl
• BayesOWL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Artificial intelligence: Methodology, systems, and applications. 12th international conference, AIMSA 2006, Varna, Bulgaria, September 12--15, 2006. Proceedings
• Probabilistic description logic programs
• Combining Horn rules and description logics in CARIN
• Probabilistic Horn abduction and Bayesian networks
• Anytime deduction for probabilistic logic
• The independent choice logic for modelling multiple agents under uncertainty
• Expressive probabilistic description logics
• Combining answer set programming with description logics for the semantic web
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• GOLOG: A logic programming language for dynamic domains
• Reasoning about actions with sensing under qualitative and probabilistic uncertainty
• ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• Logics in Artificial Intelligence
• Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web