000			04593nam a22006255i 4500
001			978-3-540-79719-7
003			DE-He213
005			20240423130226.0
007			cr nn 008mamaa
008			100301s2008 gw | s |||| 0|eng d
020			_a9783540797197 _9978-3-540-79719-7
024	7		_a10.1007/978-3-540-79719-7 _2doi
050		4	_aQA267-268.5
072		7	_aUYA _2bicssc
072		7	_aCOM014000 _2bisacsh
072		7	_aUYA _2thema
082	0	4	_a005.131 _223
245	1	0	_aTheory and Applications of Satisfiability Testing – SAT 2008 _h[electronic resource] : _b11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / _cedited by Hans Kleine Büning, Xishun Zhao.
250			_a1st ed. 2008.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008.
300			_aX, 305 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4996
505	0		_aModelling Max-CSP as Partial Max-SAT -- A Preprocessor for Max-SAT Solvers -- A Generalized Framework for Conflict Analysis -- Adaptive Restart Strategies for Conflict Driven SAT Solvers -- New Results on the Phase Transition for Random Quantified Boolean Formulas -- Designing an Efficient Hardware Implication Accelerator for SAT Solving -- Attacking Bivium Using SAT Solvers -- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers -- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms -- Complexity and Algorithms for Well-Structured k-SAT Instances -- A Decision-Making Procedure for Resolution-Based SAT-Solvers -- Online Estimation of SAT Solving Runtime -- A Max-SAT Inference-Based Pre-processing for Max-Clique -- SAT, UNSAT and Coloring -- Computation of Renameable Horn Backdoors -- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors -- Improvements to Hybrid Incremental SAT Algorithms -- Searching for Autarkies to Trim Unsatisfiable Clause Sets -- Nenofex: Expanding NNF for QBF Solving -- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions -- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms -- A CNF Class Generalizing Exact Linear Formulas -- How Many Conflicts Does It Need to Be Unsatisfiable? -- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning -- Local Restarts -- Regular and General Resolution: An Improved Separation -- Finding Guaranteed MUSes Fast.
520			_aThis book constitutes the refereed proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008, held in Guangzhou, P. R. China, in May 2008. The 17 revised full papers presented together with 8 revised short papers and 2 invited talks were carefully selected from 70 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.
650		0	_aMachine theory.
650		0	_aAlgorithms.
650		0	_aOperating systems (Computers).
650		0	_aNumerical analysis.
650		0	_aArtificial intelligence.
650		0	_aMathematical logic.
650	1	4	_aFormal Languages and Automata Theory.
650	2	4	_aAlgorithms.
650	2	4	_aOperating Systems.
650	2	4	_aNumerical Analysis.
650	2	4	_aArtificial Intelligence.
650	2	4	_aMathematical Logic and Foundations.
700	1		_aKleine Büning, Hans. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aZhao, Xishun. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540797180
776	0	8	_iPrinted edition: _z9783540850113
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4996
856	4	0	_uhttps://doi.org/10.1007/978-3-540-79719-7
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c186372 _d186372