Easy cases of probabilistic satisfiability

DOI10.1023/A:1012332915908MaRDI QIDQ2349813zbMATH OpenOpenAlexWikidataFDO

Authors Kim Allan Andersen, D. Pretolani

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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Logic in artificial intelligence (68T27)

Recommendations

• Probabilistic satisfiability
• Probability logic and optimization SAT: The PSAT and CPA models
• Generalized probabilistic satisfiability
• Probabilistic satisfiability
• A linear programming approach to reasoning about probabilities

Cited in

(11)

• A hybrid method for probabilistic satisfiability
• Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking
• Quantitative logic reasoning
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Optimization and probabilistic satisfiability on nested and co-nested formulas
• Probabilistic sentence satisfiability: an approach to PSAT
• Probabilistic satisfiability
• Generalized probabilistic satisfiability
• Consistency checking and querying in probabilistic databases under integrity constraints
• Probabilistic satisfiability and coherence checking through integer programming
• Probability logic and optimization SAT: The PSAT and CPA models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349813)