Probabilistic logic programming with conditional constraints
From MaRDI portal
Publication:3549126
DOI10.1145/377978.377983zbMath1171.68762OpenAlexW2005277728MaRDI QIDQ3549126
Publication date: 21 December 2008
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/377978.377983
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Related Items (29)
Probabilistic logic under coherence: complexity and algorithms ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ Beyond multi-adjoint logic programming ⋮ Computational complexity of queries based on itemsets ⋮ Probabilistic logic with independence ⋮ Probabilistic description logic programs under inheritance with overriding for the semantic Web ⋮ Expressive probabilistic description logics ⋮ Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ A deductive probabilistic and fuzzy object-oriented database language. ⋮ Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction ⋮ Consistency checking and querying in probabilistic databases under integrity constraints ⋮ Weak nonmonotonic probabilistic logics ⋮ The complexity of satisfying constraints on databases of transactions ⋮ On the complexity of propositional and relational credal networks ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Safe projections of binary data sets ⋮ Probabilistic description logic programs ⋮ Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding ⋮ Complexity results for structure-based causality.
This page was built for publication: Probabilistic logic programming with conditional constraints
