Stable semantics for probabilistic deductive databases

DOI10.1006/INCO.1994.1023zbMath0804.68026OpenAlexW2048544655MaRDI QIDQ1322464

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

zbMATH Keywords

uncertain informationprobabilistic logic programstable class semanticsmultivalued logic programmingprobabilistic deductive databasessemantics of non- monotonic negation

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (14)

A new approach to hybrid probabilistic logic programs ⋮ A Logical Approach to Qualitative and Quantitative Reasoning ⋮ A core language for fuzzy answer set programming ⋮ On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability ⋮ Reducing fuzzy answer set programming to model finding in fuzzy logics ⋮ Query evaluation in probabilistic relational databases ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Probabilistic reasoning with answer sets ⋮ Aggregated fuzzy answer set programming ⋮ A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ The theory of interval probabilistic logic programs ⋮ Reasoning with Uncertainty in Deductive Databases and Logic Programs ⋮ Annotated revision programs

This page was built for publication: Stable semantics for probabilistic deductive databases