zbMATH — the first resource for mathematics

Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. (English) Zbl 1136.68007
Lecture Notes in Computer Science 4996. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). x, 305 p. (2008).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1120.68007).
Indexed articles:
Argelich, Josep; Cabiscol, Alba; Lynce, Inês; Manyà, Felip, Modelling Max-CSP as partial Max-SAT, 1-14 [Zbl 1138.68531]
Argelich, Josep; Li, Chu Min; Manyà, Felip, A preprocessor for Max-SAT solvers, 15-20 [Zbl 1138.68532]
Audemard, G.; Bordeaux, L.; Hamadi, Y.; Jabbour, S.; Sais, L., A generalized framework for conflict analysis, 21-27 [Zbl 1138.68485]
Biere, Armin, Adaptive restart strategies for conflict driven SAT solvers, 28-33 [Zbl 1138.68533]
Creignou, Nadia; Daudé, Hervé; Egly, Uwe; Rossignol, Raphaël, New results on the phase transition for random quantified Boolean formulas, 34-47 [Zbl 1138.68534]
Davis, John D.; Tan, Zhangxi; Yu, Fang; Zhang, Lintao, Designing an efficient hardware implication accelerator for SAT solving, 48-62 [Zbl 1138.68535]
Eibach, Tobias; Pilz, Enrico; Völkel, Gunnar, Attacking Bivium using SAT solvers, 63-76 [Zbl 1138.68536]
Faure, Germain; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric, SAT modulo the theory of linear arithmetic: Exact, inexact and commercial solvers, 77-90 [Zbl 1138.68537]
Gao, Yong, Random instances of W[2]-complete problems: Thresholds, complexity, and algorithms, 91-104 [Zbl 1138.68425]
Georgiou, Konstantinos; Papakonstantinou, Periklis A., Complexity and algorithms for well-structured \(k\)-SAT instances, 105-118 [Zbl 1138.68538]
Goldberg, Eugene, A decision-making procedure for resolution-based SAT-solvers, 119-132 [Zbl 1138.68539]
Haim, Shai; Walsh, Toby, Online estimation of SAT solving runtime, 133-138 [Zbl 1138.68540]
Heras, Federico; Larrosa, Javier, A Max-SAT inference-based pre-processing for Max-Clique, 139-152 [Zbl 1138.68541]
Kottler, Stephan; Kaufmann, Michael; Sinz, Carsten, Computation of renameable Horn backdoors, 154-160 [Zbl 1138.68542]
Kottler, Stephan; Kaufmann, Michael; Sinz, Carsten, A new bound for an NP-hard subclass of 3-SAT using backdoors, 161-167 [Zbl 1138.68543]
Letombe, Florian; Marques-Silva, Joao, Improvements to hybrid incremental SAT algorithms, 168-181 [Zbl 1138.68544]
Liffiton, Mark; Sakallah, Karem, Searching for autarkies to trim unsatisfiable clause sets, 182-195 [Zbl 1138.68545]
Lonsing, Florian; Biere, Armin, Nenofex: Expanding NNF for QBF solving, 196-210 [Zbl 1138.68546]
Mariën, Maarten; Wittocx, Johan; Denecker, Marc; Bruynooghe, Maurice, SAT(ID): Satisfiability of propositional logic extended with inductive definitions, 211-224 [Zbl 1138.68547]
Marques-Silva, Joao; Manquinho, Vasco, Towards more effective unsatisfiability-based maximum satisfiability algorithms, 225-230 [Zbl 1138.68548]
Porschen, Stefan; Speckenmeyer, Ewald, A CNF class generalizing exact linear formulas, 231-245 [Zbl 1138.68550]
Scheder, Dominik; Zumstein, Philipp, How many conflicts does it need to be unsatisfiable?, 246-256 [Zbl 1138.68553]
Stachniak, Zbigniew; Belov, Anton, Speeding-up non-clausal local search for propositional satisfiability with clause learning, 257-270 [Zbl 1138.68554]
Ryvchin, Vadim; Strichman, Ofer, Local restarts, 271-276 [Zbl 1138.68552]
Urquhart, Alasdair, Regular and general resolution: An improved separation, 277-290 [Zbl 1138.68530]
van Maaren, Hans; Wieringa, Siert, Finding guaranteed MUSes fast, 291-304 [Zbl 1138.68555]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI