Name: SAT 2005: Satisfiability Research in the Year 2005 (en Inglés)
SKU: 58545912
Price: 140.37 USD
Availability: InStock
Author: Giunchiglia, Enrico ; Walsh, Toby

portada SAT 2005: Satisfiability Research in the Year 2005 (en Inglés)

SAT 2005: Satisfiability Research in the Year 2005 (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Giunchiglia, Enrico ; Walsh, Toby

Idioma

Inglés

N° páginas

293

Encuadernación

Tapa Blanda

Dimensiones

23.4x15.6x1.6 cm

Peso

0.42 kg.

ISBN13

9789400787155

Categorías

Programación informática/desarrollo de software
Inteligencia artificial

SAT 2005: Satisfiability Research in the Year 2005 (en Inglés)

Giunchiglia, Enrico ; Walsh, Toby (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 280.74$ 140.37

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 140.37

Llega entre el 15 Sep y el 28 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "SAT 2005: Satisfiability Research in the Year 2005 (en Inglés)"

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.