A resolution proof system for dependency stochastic Boolean satisfiability

DOI10.1007/S10817-023-09670-6MaRDI QIDQ6050766zbMATH OpenFDO

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

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

• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Building strategies into QBF proofs
• Certified DQBF solving by definition extraction
• Contingent planning under uncertainty via stochastic satisfiability
• Davis and Putnam meet Henkin: solving DQBF with resolution
• Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
• Games against nature
• Generalized Craig interpolation for stochastic Boolean satisfiability problems with applications to probabilistic state reachability and region stability
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• Lifting QBF resolution calculi to DQBF
• Lower bounds for multiplayer noncooperative games of incomplete information
• Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
• Resolution for stochastic Boolean satisfiability
• Stochastic Boolean satisfiability
• Towards Formal Evaluation and Verification of Probabilistic Design

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

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