Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic

DOI10.1007/978-3-540-68155-7_20zbMath1142.68525OpenAlexW1511506132MaRDI QIDQ5387634

Tino Teige, Martin Fränzle

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_20

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems ⋮ Engineering constraint solvers for automatic analysis of probabilistic hybrid automata ⋮ Challenges in Constraint-Based Analysis of Hybrid Systems

Uses Software

• HySAT

Cites Work

• Unnamed Item
• Unnamed Item
• Backjumping for quantified Boolean logic satisfiability
• Contingent planning under uncertainty via stochastic satisfiability
• Stochastic constraint programming: A scenario-based approach
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• Games against nature
• Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Stochastic Boolean satisfiability

This page was built for publication: Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic