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

Choose an application

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

This volume contains the proceedings of SARA 2000, the fourth Symposium on Abstraction, Reformulations, and Approximation (SARA). The conference was held at Horseshoe Bay Resort and Conference Club, Lake LBJ, Texas, July 26– 29, 2000, just prior to the AAAI 2000 conference in Austin. Previous SARA conferences took place at Jackson Hole in Wyoming (1994), Ville d’Est´erel in Qu´ebec (1995), and Asilomar in California (1998). The symposium grew out of a series of workshops on abstraction, approximation, and reformulation that had taken place alongside AAAI since 1989. This year’s symposium was actually scheduled to take place at Lago Vista Clubs & Resort on Lake Travis but, due to the resort’s failure to pay taxes, the conference had to be moved late in the day. This mischance engendered eleventh-hour reformulations, abstractions, and resource re-allocations of its own. Such are the perils of organizing a conference. This is the first SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a reflection of the increased maturity of the field and that the increased visibility brought by the publication of this volume will help the discipline grow even further. Abstractions, reformulations, and approximations (AR&A) have found - plications in a variety of disciplines and problems including automatic programming, constraint satisfaction, design, diagnosis, machine learning, planning, qualitative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains.

Computer science --- Artificial intelligence --- Computer Science --- Engineering & Applied Sciences --- Computer science. --- Software engineering. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Artificial Intelligence (incl. Robotics). --- Software Engineering/Programming and Operating Systems. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Computer software engineering --- Engineering --- 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 --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Computer science logic --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science - Congresses --- Artificial intelligence - Congresses --- Logic, Symbolic and mathematical.

Choose an application

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

This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held in Paphos, Cyprus, in November/December 2001. The 37 revised full papers, 9 innovative applications presentations, and 14 short papers presented were carefully reviewed and selected from a total of 135 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to advanced and innovative applications in a variety of fields.

Constraint programming (Computer science) --- Programmation par contraintes --- Congresses. --- Congrès --- Computer Science --- Engineering & Applied Sciences --- 681.3*D1 --- 681.3*D32 --- 681.3*D33 --- 681.3*F23 --- 681.3*F24 --- Computer programming --- Programming techniques--See also {681.3*E} --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- Tradeoffs among complexity measures (Analysis of algorithms and problem complexity)--See also {681.3*F13} --- Computerwetenschap--?*F24 --- 681.3*F23 Tradeoffs among complexity measures (Analysis of algorithms and problem complexity)--See also {681.3*F13} --- 681.3*D33 Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D1 Programming techniques--See also {681.3*E} --- Congrès --- Computer science. --- Software engineering. --- Computer programming. --- Programming languages (Electronic computers). --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Artificial Intelligence (incl. Robotics). --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- 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 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Languages, Artificial --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer software engineering --- Engineering --- Informatics --- Science --- Programming --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Constraint programming (Computer science) - Congresses --- Programming languages (Electronic computers) --- Logic, Symbolic and mathematical.