عنوان
پدید آورنده
موضوع
رده
QA76.9.A43 S28 2006eb
QA76
.
9
.
A43
S28
2006eb
کتابخانه
محل استقرار
1280744995
1402045522
1402055714
9781280744990
9781402045523
9781402055713
b714013
SAT 2005 :
[Book]
satisfiability research in the year 2005 /
edited by Enrico Giunchiglia and Toby Walsh.
Dordrecht :
Springer,
©2006.
1 online resource (293 pages) :
illustrations
"Reprinted from Journal of automated reasoning, v. 35, nos. 1-3 (2005)."
Includes bibliographical references.
Satisfiability in the Year 2005; Heuristic-Based Backtracking Relaxation for Propositional Satisfiability; Symbolic Techniques in Satisfiability Solving; Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas; Backdoor Sets for DLL Subsolvers; The Complexity of Pure Literal Elimination; Clause Weighting Local Search for SAT; Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings; Regular Random k-SAT: Properties of Balanced Formulas; Applying SAT Solving in Classification of Finite Algebras.
0
Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. This work deals with the progress made in solving propositional satisfiability and related problems.
Springer
978-1-4020-4552-3
SAT 2005.
1402045522
Satisfiability research in the year 2005
Computational complexity.
Computer algorithms.
Propositional calculus.
Computational complexity.
Computational complexity.
Computer algorithms.
Computer algorithms.
COMPUTERS-- Programming-- Open Source.
COMPUTERS-- Software Development & Engineering-- General.
COMPUTERS-- Software Development & Engineering-- Tools.
Informatique.
Propositional calculus.
Propositional calculus.
COM-- 051230
COM-- 051390
COM-- 051440
U
005
.
1
22
QA76
.
9
.
A43
S28
2006eb
TP301
.
6
clc
Giunchiglia, Enrico.
Walsh, Toby.
20201208042103.0
pn
مطالعه متن کتاب [Book]
Y
