Expressive probabilistic description logics
From MaRDI portal
Publication:2389639
DOI10.1016/j.artint.2007.10.017zbMath1182.68283OpenAlexW2055641305MaRDI QIDQ2389639
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2007.10.017
complexityalgorithmsprobabilistic default reasoningprobabilistic description logicsconditional knowledge basesuncertainty reasoning for the semantic web
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (29)
Query answering in circumscribed OWL2 profiles ⋮ Extending description logics with uncertainty reasoning in possibilistic logic ⋮ Reasoning within intuitionistic fuzzy rough description logics ⋮ Tableau reasoning for description logics and its extension to probabilities ⋮ On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ Uncertain lightweight ontologies in a product-based possibility theory framework ⋮ PR-OWL - a language for defining probabilistic ontologies ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ Aleatoric propositions: reasoning about coins ⋮ Tightly integrated probabilistic description logic programs for representing ontology mappings ⋮ Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities ⋮ Reasoning with Uncertain and Inconsistent OWL Ontologies ⋮ Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies ⋮ Granular computing applied to ontologies ⋮ Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings ⋮ Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete ⋮ A Hybrid Method for Probabilistic Satisfiability ⋮ Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach ⋮ A reconstruction of multipreference closure ⋮ Reasoning with rough description logics: An approximate concepts approach ⋮ Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure ⋮ Rational closure for all description logics ⋮ Fuzzy description logics with general t-norms and datatypes ⋮ Reasoning within expressive fuzzy rough description logics ⋮ Typicalities and probabilities of exceptions in nonmotonic description logics ⋮ Towards Contingent World Descriptions in Description Logics ⋮ Probabilistic satisfiability and coherence checking through integer programming ⋮ Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing functions with parallel queries to NP
- Probabilistic logic under coherence: complexity and algorithms
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Conditional entailment: bridging two approaches to default reasoning.
- Probabilistic description logic programs
- Probabilistic logic
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Probabilistic satisfiability
- A logic for default reasoning
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the consistency of defeasible databases
- What does a conditional knowledge base entail?
- A taxonomy of complexity classes of functions
- Anytime deduction for probabilistic logic
- Nonmonotonic reasoning, conditional objects and possibility theory
- Belief functions and default reasoning
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Probabilistic default reasoning with conditional constraints
- A logic for reasoning about probabilities
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Another perspective on default reasoning
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- Weak nonmonotonic probabilistic logics
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Soft computing in ontologies and semantic web.
- Complexity of the two-variable fragment with counting quantifiers
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
- The computational complexity of probabilistic inference using Bayesian belief networks
- On the hardness of approximate reasoning
- Ontology Matching
- Probabilistic logic programming with conditional constraints
- Column Generation Methods for Probabilistic Logic
- ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
- PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT
- Conditional objects as nonmonotonic consequence relationships
This page was built for publication: Expressive probabilistic description logics
