Tightly integrated probabilistic description logic programs for representing ontology mappings
answer set semanticsdata integrationdatabasesdescription logic programsdescription logicsinconsistencylogic programsontologiesontology mappingsprobabilistic logicssemantic webuncertaintywell-founded semantics
Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Probabilistic description logic programs
- Expressive probabilistic description logics
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
- Combining answer set programming with description logics for the semantic web
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Expressive probabilistic description logics
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1931651 (Why is no real title available?)
- Linking Data to Ontologies
- Logical foundations of object-oriented and frame-based languages
- Logics in Artificial Intelligence
- Probabilistic description logic programs
- The independent choice logic for modelling multiple agents under uncertainty
- The well-founded semantics for general logic programs
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Probabilistic entailment in the setting of coherence: the role of quasi conjunction and inclusion relation
- RETRACTED ARTICLE: Uncertainty modeling based on Bayesian network in ontology mapping
- Uncertainty in Semantic Ontology Mapping: An Evidential Approach
- Mapping Properties of Heterogeneous Ontologies
- Complexity of reasoning with expressive ontology mappings
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Reasoning with uncertain and inconsistent OWL ontologies
- On the complexity of propositional and relational credal networks
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Languages for probabilistic modeling over structured and relational domains
- A semantics for probabilistic hybrid knowledge bases with function symbols
This page was built for publication: Tightly integrated probabilistic description logic programs for representing ontology mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429437)