Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the thoroughly refereed conference proceedings of the 4th International Conference on Algorithmic Decision Theory , ADT 2015, held in September 2015 in Lexington, USA. The 32 full papers presented were carefully selected from 76 submissions. The papers are organized in topical sections such as preferences; manipulation, learning and other issues; utility and decision theory; argumentation; bribery and control; social choice; allocation and other problems; doctoral consortium.

Computer Science. --- Artificial Intelligence (incl. Robotics). --- Algorithm Analysis and Problem Complexity. --- Information Systems Applications (incl. Internet). --- Probability and Statistics in Computer Science. --- Computer Communication Networks. --- Programming Techniques. --- Computer science. --- Computer software. --- Artificial intelligence. --- Informatique --- Réseaux d'ordinateurs --- Logiciels --- Intelligence artificielle --- Computer Science --- Mechanical Engineering - General --- Engineering & Applied Sciences --- Mechanical Engineering --- Computer communication systems. --- Computer programming. --- Algorithms. --- Mathematical statistics. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Algorism --- Algebra --- Arithmetic --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Statistical methods --- Foundations --- Programming --- Distributed processing --- Artificial Intelligence. --- Software, Computer --- Computer systems --- Decision making --- Mathematical models --- Application software. --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Artificial intelligence.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Artificial intelligence--Data processing. --- Artificial intelligence--Design and construction.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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. As this volume demonstrates, research has continued very actively in this area since then. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

Information theory. --- Artificial intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Communication theory --- Communication --- Cybernetics --- Information Technology --- Artificial Intelligence --- Software engineering. --- Software Engineering/Programming and Operating Systems. --- Artificial Intelligence. --- Theory of Computation. --- Computer software engineering --- Engineering --- Computers. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace