Theory and Applications of Satisfiability Testing Research in propositional and quantified Boolean formula satisfiability testing is covered. This book also includes information on proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial applications, specific tools, case studies, and empirical results.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 4,93 expédition vers Etats-Unis
Destinations, frais et délaisEUR 3,57 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : thebookforest.com, San Rafael, CA, Etats-Unis
paperback. Etat : New. Well packaged and promptly shipped from California. US veteran operated. N° de réf. du vendeur 1LAGBP001D50
Quantité disponible : 1 disponible(s)
Vendeur : Doss-Haus Books, Redondo Beach, CA, Etats-Unis
Hardcover. Etat : Very Good. No Jacket. Hardcover 2005 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;3569. [xii, 492 p. : ill. ; 24 cm]. N° de réf. du vendeur 011792
Quantité disponible : 1 disponible(s)
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. N° de réf. du vendeur UTD14a-1725
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020164424
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The 8th International Conference on Theory and Applications of Satis ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis ability testing has proved to extremely useful in a wide range of di erent disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most e ective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools. This volume contains the papers accepted for presentation at SAT 2005. The conference attracted a record number of 73 submissions. Of these, 26 papers were accepted for presentation in the technical programme. In addition, 16 - pers were accepted as shorter papers and were presented as posters during the technicalprogramme.Theacceptedpapersandposterpaperscoverthefullran ge of topics listed in the call for papers. 508 pp. Englisch. N° de réf. du vendeur 9783540262763
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783540262763_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 508. N° de réf. du vendeur 263062940
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The 8th International Conference on Theory and Applications of Satis ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis ability testing has proved to extremely useful in a wide range of di erent disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most e ective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools. This volume contains the papers accepted for presentation at SAT 2005. The conference attracted a record number of 73 submissions. Of these, 26 papers were accepted for presentation in the technical programme. In addition, 16 - pers were accepted as shorter papers and were presented as posters during the technicalprogramme.Theacceptedpapersandposterpaperscoverthefullrange of topics listed in the call for papers. N° de réf. du vendeur 9783540262763
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 508 Illus. N° de réf. du vendeur 5833539
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 508. N° de réf. du vendeur 183062934
Quantité disponible : 1 disponible(s)