A semantics for probabilistic hybrid knowledge bases with function symbols
From MaRDI portal
Cites work
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- A semantics for hybrid probabilistic logic programs with function symbols
- Abducing through negation as failure: stable models within the independent choice logic
- ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
- An iterative fixpoint semantics for MKNF hybrid knowledge bases with function symbols
- Combining answer set programming with description logics for the semantic web
- Computable Functions in ASP: Theory and Implementation
- Expressive probabilistic description logics
- Finitely recursive programs: decidability and bottom-up computation
- Foundations of a functional approach to knowledge representation
- scientific article; zbMATH DE number 67490 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1931651 (Why is no real title available?)
- Local closed world reasoning with description logics under the well-founded semantics
- Logic Programming
- Normative systems represented as hybrid knowledge bases
- On the relative expressiveness of description logics and predicate logics
- Probabilistic default reasoning with conditional constraints
- Probabilistic description logic programs
- Probabilistic Horn abduction and Bayesian networks
- Probabilistic Hybrid Knowledge Bases Under the Distribution Semantics
- Probabilistic logic
- ProbLog Technology for Inference in a Probabilistic First Order Logic
- Query-driven procedures for hybrid MKNF knowledge bases
- Reconciling description logics and rules
- Statistical relational artificial intelligence: logic, probability, and computation
- Tableau reasoning for description logics and its extension to probabilities
- Terminating evaluation of logic programs with finite three-valued models
- The distribution semantics for normal programs with function symbols
- The independent choice logic for modelling multiple agents under uncertainty
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- The well-founded semantics for general logic programs
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Tightly integrated probabilistic description logic programs for representing ontology mappings
This page was built for publication: A semantics for probabilistic hybrid knowledge bases with function symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956884)