scientific article
From MaRDI portal
Publication:2741533
zbMath0990.90559MaRDI QIDQ2741533
Moshe Y. Vardi, Enrico Giunchiglia, Armando Tacchella, Massimo Narizzano
Publication date: 24 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Backjumping for quantified Boolean logic satisfiability
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Symbolic model checking: \(10^{20}\) states and beyond
- Boosting complete techniques thanks to local search methods
- Semantics and complexity of abduction from default theories
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- NuSMV: A new symbolic model checker
- Tractable reasoning in artificial intelligence
- Testing heuristics: We have it all wrong
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- The propositional formula checker HeerHugo
- Implementing the Davis-Putnam method
- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
- GRASP: a search algorithm for propositional satisfiability
- A machine program for theorem-proving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
