A resolution proof system for dependency stochastic Boolean satisfiability

DOI10.1007/s10817-023-09670-6MaRDI QIDQ6050766

Jie-Hong R. Jiang, Yunrong Luo, Che Cheng

Publication date: 19 September 2023

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

resolution calculusproof systemdependency stochastic Boolean satisfiabilitysatisfying probability

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contingent planning under uncertainty via stochastic satisfiability
• Games against nature
• Building strategies into QBF proofs
• Davis and Putnam meet Henkin: solving DQBF with resolution
• Certified DQBF solving by definition extraction
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• Lifting QBF Resolution Calculi to DQBF
• Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability
• Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
• Towards Formal Evaluation and Verification of Probabilistic Design
• Resolution for Stochastic Boolean Satisfiability
• Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
• Lower bounds for multiplayer noncooperative games of incomplete information
• Stochastic Boolean satisfiability

This page was built for publication: A resolution proof system for dependency stochastic Boolean satisfiability