Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems
From MaRDI portal
Publication:3000643
DOI10.1007/978-3-642-19835-9_14zbMath1315.68183OpenAlexW1592721539MaRDI QIDQ3000643
Publication date: 19 May 2011
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19835-9_14
Specification and verification (program logics, model checking, etc.) (68Q60) Interpolation, preservation, definability (03C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Contingent planning under uncertainty via stochastic satisfiability
- Games against nature
- Resolution for quantified Boolean formulas
- Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Resolution for Stochastic Boolean Satisfiability
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Stochastic Boolean satisfiability
This page was built for publication: Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems
