Articles liés à SAT 2005: Satisfiability Research in the Year 2005
Synopsis
This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia mathematica".
In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 136,16
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour SAT 2005: Satisfiability Research in the Year 2005
Image fournie par le vendeur
SAT 2005
Edité par
Springer Netherlands, 2014
ISBN 10 : 9400787154
ISBN 13 : 9789400787155
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents an up to date snapshot of a very active research areaProvides many practical applications (especially in the area of hardware verification)Presents a survey of the breadth of research in this areaThis book covers recent . N° de réf. du vendeur 11511026
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
SAT 2005
Edité par
Springer Netherlands Dez 2014, 2014
ISBN 10 : 9400787154
ISBN 13 : 9789400787155
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book covers recent progress in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. 300 pp. Englisch. N° de réf. du vendeur 9789400787155
Quantité disponible : 2 disponible(s)
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9789400787155_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
SAT 2005 : Satisfiability Research in the Year 2005
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's 'Principia mathematica'.In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory. N° de réf. du vendeur 9789400787155
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
SAT 2005
Edité par
Springer Netherlands, Springer Netherlands Dez 2014, 2014
ISBN 10 : 9400787154
ISBN 13 : 9789400787155
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's 'Principia mathematica'.In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 300 pp. Englisch. N° de réf. du vendeur 9789400787155
Quantité disponible : 1 disponible(s)
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9789400787155
Quantité disponible : Plus de 20 disponibles
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Apr0412070051608
Quantité disponible : Plus de 20 disponibles
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 300. N° de réf. du vendeur 26356984051
Quantité disponible : 4 disponible(s)
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 300. N° de réf. du vendeur 18356984057
Quantité disponible : 4 disponible(s)
Image d'archives
SAT 2005: Satisfiability Research in the Year 2005
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 300. N° de réf. du vendeur 355506988
Quantité disponible : 4 disponible(s)