Stable semantics for probabilistic deductive databases
From MaRDI portal
Publication:1322464
DOI10.1006/INCO.1994.1023zbMATH Open0804.68026OpenAlexW2048544655MaRDI QIDQ1322464FDOQ1322464
Authors: V. S. Subrahmanian, Raymond T. Ng 
Publication date: 12 January 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1023
Recommendations
uncertain informationprobabilistic logic programstable class semanticsmultivalued logic programmingprobabilistic deductive databasessemantics of non- monotonic negation
Cited In (15)
- Annotated revision programs
- Query evaluation in probabilistic relational databases
- A top-\(k\) query answering procedure for fuzzy logic programming
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Reasoning with uncertainty in deductive databases and logic programs
- A core language for fuzzy answer set programming
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- Aggregated fuzzy answer set programming
- A Logical Approach to Qualitative and Quantitative Reasoning
- A new approach to hybrid probabilistic logic programs
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- The theory of interval probabilistic logic programs
- Probabilistic reasoning with answer sets
- A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics
This page was built for publication: Stable semantics for probabilistic deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322464)
