Handbook of Satisfiability : Handbook of Satisfiability.

"Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through S...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Biere, A.
Other Authors: Heule, M., Van Maaren, H.
Format: Electronic eBook
Language:Inglés
Published: Amsterdam : IOS Press, 2009.
Series:Frontiers in artificial intelligence and applications.
Subjects:
Propositional calculus > Congresses.
Decision making > Congresses.
Computer algorithms > Congresses.
Algebra, Boolean > Congresses.
Calcul propositionnel > Congrès.
Prise de décision > Congrès.
Algorithmes > Congrès.
Algèbre de Boole > Congrès.
Algebra, Boolean
Computer algorithms
Decision making
Propositional calculus
Conference papers and proceedings
Online Access:Texto completo
Description
Summary:"Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware.
Item Description:8.9 Backtracking Algorithms.
Physical Description:1 online resource (980 pages)
ISBN:9781607503767
160750376X

Similar Items