Probabilistic description logic programs
From MaRDI portal
Publication:997050
DOI10.1016/J.IJAR.2006.06.012zbMATH Open1122.68027OpenAlexW2013476941MaRDI QIDQ997050FDOQ997050
Authors: Thomas Lukasiewicz 
Publication date: 19 July 2007
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2006.06.012
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Expressive probabilistic description logics
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
description logicprobabilistic uncertaintyanswer set semanticswell-founded semanticsindependent choice logicnormal programstratified program
Cites Work
- Programming with linear fractional functionals
- Combining answer set programming with description logics for the semantic web
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Title not available (Why is that?)
- The independent choice logic for modelling multiple agents under uncertainty
- Reasoning within fuzzy description logics
- Combining probabilistic logic programming with the power of maximum entropy
- Title not available (Why is that?)
- Combining Horn rules and description logics in CARIN
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Probabilistic logic programming with conditional constraints
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
Cited In (27)
- P-log: refinement and a new coherency condition
- The generalised distribution semantics and projective families of distributions
- pSPARQL: a querying language for probabilistic RDF data
- Mining the semantic web statistical learning for next generation knowledge bases
- Answer Set Programming: A Primer
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Title not available (Why is that?)
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Combining answer set programming with description logics for the semantic web
- A formal framework for description logics with uncertainty
- Understanding a Probabilistic Description Logic via Connections to First-Order Logic of Probability
- Explanations as programs in probabilistic logic programming
- On the complexity of probabilistic abstract argumentation frameworks
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Expressive probabilistic description logics
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Learning description logic axioms from discrete probability distributions over description graphs
- Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- PR-OWL - a language for defining probabilistic ontologies
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Complexity results for probabilistic answer set programming
Uses Software
This page was built for publication: Probabilistic description logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997050)
