ISBN: 9783662504963 - decision procedures: an algorithmic point of view (20 risultati)

Perfeziona la tua ricerca

Hai cercato

  • Libri (20)

a

Fascia di prezzo personalizzata (EUR)

a

  • Condizione: Usato - Buono

    EUR 44,53

    EUR 3,42 spedizione 
    Spedito in U.S.A.

    Quantità: 1 disponibile

    hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 58,04

    EUR 2,41 spedizione 
    Spedito in U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New.

  • Lingua: Inglese

    Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 60,53

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Hardback. Condizione: New. 2nd ed. 2016. A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP).  The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.…

  • Condizione: Nuovo

    EUR 52,12

    EUR 15,31 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New. In English.

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 53,49

    EUR 17,90 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New.

  • Condizione: Nuovo

    EUR 83,85

    EUR 3,64 spedizione 
    Spedito in U.S.A.

    Quantità: 1 disponibile

    Condizione: New.

  • Condizione: Nuovo

    EUR 83,66

    EUR 7,76 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibile

    Condizione: New.

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios

    Venditore con 4 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 82,17

    EUR 9,95 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Condizione: New.

  • Condizione: Nuovo

    EUR 108,94

    EUR 2,74 spedizione 
    Spedito in U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New.

  • Lingua: Inglese

    Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 53,50

    EUR 77,55 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Hardback. Condizione: New. 2nd ed. 2016. A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP).  The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.…

  • Lingua: Inglese

    Editore: Springer-Verlag New York Inc, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 135,80

    EUR 14,91 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 2 disponibili

    Hardcover. Condizione: Brand New. 2nd edition. 356 pages. French language. 9.25x6.25x0.75 inches. In Stock.

  • Lingua: Inglese

    Editore: J.B. Metzler, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: Home-set, Mannheim, GermaniaHome-set

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 106,99

    EUR 49,90 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Gebundene Ausgabe. Condizione: Neu. A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP). The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bj?rner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website. Sprache: Englisch Gewicht in Gramm: 683.…

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Usato - Come nuovo

    EUR 151,15

    EUR 17,90 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: As New. Unread book in perfect condition.

  • Condizione: Usato - Come nuovo

    EUR 141,33

    EUR 29,83 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibile

    Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato

    Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Usato - Come nuovo

    EUR 174,62

    EUR 2,41 spedizione 
    Spedito in U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: As New. Unread book in perfect condition.

  • Lingua: Inglese

    Editore: Springer, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato
    • Print on Demand

    Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 70,24

    EUR 8,00 spedizione 
    Spedito da Italia a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: new. Questo è un articolo print on demand.

  • Lingua: Inglese

    Editore: Springer, Springer Jan 2017, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato
    • Print on Demand

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 85,59

    EUR 23,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it hasnow; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP). The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website. 380 pp. Englisch.…

  • Lingua: Inglese

    Editore: Springer Berlin Heidelberg, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato
    • Print on Demand

    Da: moluna, Greven, Germaniamoluna

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 72,89

    EUR 48,99 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. New edition of successful textbookAuthors have expanded the chapter on propositional encodings, added further modern SAT heuristics, and added a chapter on the application of SMT for software engineering in industrySuitable for advanced und.…

  • Lingua: Inglese

    Editore: J.B. Metzler, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 99,87

    EUR 35,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it hasnow; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP). The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.…

  • Lingua: Inglese

    Editore: Springer, Springer Jan 2017, 2017

    3662504960 / 9783662504963

    Serie: Libro 42 di 45 - Texts in Theoretical Computer Science. An EATCS

    • Rilegato
    • Print on Demand

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 85,59

    EUR 60,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP). The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 380 pp. Englisch.…