Theory and Applications of Satisfiability Testing - SAT 2008 : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
Publication year: 2008
ISBN: 978-3-540-79719-7
Internet Resource: Please Login to download book
All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.
Subject: Computer Science, Mathematical Logic and Formal Languages, Algorithm Analysis and Problem Complexity, Operating Systems, Numeric Computing, Artificial Intelligence, Mathematical Logic and Foundations, 3-SAT, Erfüllbarkeitsproblem der Aussagenlogik, Satisfiability problem of propositional logic, Resolution, algorithm, algorithms, complexity, constraint programming, local search, logic, optimization, probabilistic algorithms, proof, proof systems, proof theory, random walks
