Giunchiglia, Enrico
SAT 2005
1. Satisfiability in the Year 2005
Enrico Giunchiglia, Toby Walsh
2. Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Ateet Bhalla, Inês Lynce, José T. Sousa, João Marques-Silva
3. Symbolic Techniques in Satisfiability Solving
Guoqiang Pan, Moshe Y. Vardi
4. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
5. Backdoor Sets for DLL Subsolvers
Stefan Szeider
6. The Complexity of Pure Literal Elimination
Jan Johannsen
7. Clause Weighting Local Search for SAT
John Thornton
8. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale
9. Regular Random
Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
10. Applying SAT Solving in Classification of Finite Algebras
Andreas Meier, Volker Sorge
11. The SAT-based Approach to Separation Logic
Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
12.
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter Rossum, Stephan Schulz, Roberto Sebastiani
DRM-restrictions
Printing: not available
Clipboard copying: not available
Nyckelord: COMPUTERS / Computer Science COM014000
- Författare
- Giunchiglia, Enrico
- Walsh, Toby
- Utgivare
- Springer
- Utgivningsår
- 2006
- Språk
- en
- Utgåva
- 1
- Kategori
- Datateknik, Datakommunikation
- Format
- E-bok
- eISBN (PDF)
- 9781402055713