Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings

DOI10.1007/978-3-540-77684-0_14zbMath1138.68556MaRDI QIDQ5445301

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

Publication date: 4 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_14

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

Related Items

Tightly integrated probabilistic description logic programs for representing ontology mappings, Description logic programs under probabilistic uncertainty and fuzzy vagueness, Tractable query answering and rewriting under description logic constraints, PR-OWL - a language for defining probabilistic ontologies, Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic description logic programs
• 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
• Ontology Matching
• Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
• Logics in Artificial Intelligence