Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings > Encodings of Problems in Effectively Propositional Logic
Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings |
Joao Marques-Silva; Karem A. Sakallah
Springer Berlin Heidelberg
Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings
Encodings of Problems in Effectively Propositional Logic
Authors

Juan Antonio Navarro-Pérez; Andrei Voronkov

ARI Id

1664996845884_4396117

Access

Not Available Free

Pages

3-3

DOI

10.1007/978-3-540-72788-0_2

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-72788-0_2

Table of Contents of Book
Showing 1 to 20 of 38 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
SAT: Past and Future
Martin Davis
1-2
Encodings of Problems in Effectively Propositional Logic
Juan Antonio Navarro-Pérez; Andrei Voronkov
3-3
Efficient Circuit to CNF Conversion
Panagiotis Manolios; Daron Vroon
4-9
Mapping CSP into Many-Valued SAT
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà
10-15
Circuit Based Encoding of CNF Formula
Gilles Audemard; Lakhdar Saïs
16-21
Breaking Symmetries in SAT Matrix Models
Inês Lynce; Joao Marques-Silva
22-27
Partial Max-SAT Solvers with Clause Learning
Josep Argelich; Felip Manyà
28-40
MiniMaxSat: A New Weighted Max-SAT Solver
Federico Heras; Javier Larrosa; Albert Oliveras
41-55
Solving Multi-objective Pseudo-Boolean Problems
Martin Lukasiewycz; Michael Glaß; Christian Haubelt; Jürgen Teich
56-69
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Arist Kojevnikov
70-79
Horn Upper Bounds and Renaming
Marina Langlois; Robert H. Sloan; György Turán
80-93
Matched Formulas and Backdoor Sets
Stefan Szeider
94-99
Short XORs for Model Counting: From Theory to Practice
Carla P. Gomes; Joerg Hoffmann; Ashish Sabharwal; Bart Selman
100-106
Variable Dependency in Local Search: Prevention Is Better Than Cure
Steven Prestwich
107-120
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Chu Min Li; Wanxia Wei; Harry Zhang
121-133
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Marijn Heule; Hans van Maaren
134-147
Satisfiability with Exponential Families
Dominik Scheder; Philipp Zumstein
148-158
Formalizing Dangerous SAT Encodings
Alexander Hertel; Philipp Hertel; Alasdair Urquhart
159-172
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Stefan Porschen; Ewald Speckenmeyer
173-186
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 38 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings