Easy cases of probabilistic satisfiability

DOI10.1023/A:1012332915908zbMath1314.68149OpenAlexW1532097860WikidataQ113957469 ScholiaQ113957469MaRDI QIDQ2349813

Daniele Pretolani, Kim Allan Andersen

Publication date: 17 June 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012332915908

zbMATH Keywords

directed hypergraphsCNF formulaspartial \(k\)-treesprobabilistic satisfiabilitybalanced matrices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Logic in artificial intelligence (68T27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Probabilistic satisfiability: algorithms with the presence and absence of a phase transition ⋮ Optimization and probabilistic satisfiability on nested and co-nested formulas ⋮ Consistency checking and querying in probabilistic databases under integrity constraints ⋮ Quantitative Logic Reasoning ⋮ Probability logic and optimization SAT: The PSAT and CPA models ⋮ Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking ⋮ Probabilistic satisfiability and coherence checking through integer programming

This page was built for publication: Easy cases of probabilistic satisfiability