Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

DOI10.1007/978-3-642-00685-2_4MaRDI QIDQ3638227zbMATH OpenOpenAlexFDO

Authors Andrea Calí, Thomas Lukasiewicz, Livia Predoiu, Heiner Stuckenschmidt

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

algorithmscomplexitydescription logicssemantic webdisjunctive logic programsweb servicesanswer set semanticsdata tractabilityinconsistency handlingontology mappingprobabilistic description logic programsBayesian probabilitiesmerging ontology mappings

Mathematics Subject Classification ID

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

Recommendations

• Tightly integrated probabilistic description logic programs for representing ontology mappings
• Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
• Probabilistic description logic programs
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Probabilistic description logic programs under inheritance with overriding for the semantic Web

Cites work

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

Cited in

(7)

• Extending description logics with uncertainty reasoning in possibilistic logic
• A semantics for probabilistic hybrid knowledge bases with function symbols
• Tightly integrated probabilistic description logic programs for representing ontology mappings
• Probabilistic description logic programs
• Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
• Tableau reasoning for description logics and its extension to probabilities
• Probabilistic description logic programs under inheritance with overriding for the semantic Web

Describes a project that uses

Uses Software

• BayesOWL
• swrl
• GOLOG

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638227)