Narrow your search

Library

KU Leuven (4)

Odisee (4)

Thomas More Kempen (4)

Thomas More Mechelen (4)

UCLL (4)

VIVES (4)

ULB (3)

ULiège (3)

KBC (1)

UGent (1)


Resource type

book (4)


Language

English (4)


Year
From To Submit

2017 (1)

2015 (1)

2006 (1)

2005 (1)

Listing 1 - 4 of 4
Sort by

Book
Algorithmic Decision Theory : 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings
Author:
ISBN: 9783319231143 3319231138 9783319231136 3319231146 Year: 2015 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Keywords

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

SAT 2005 : satisfiability research in the year 2005
Authors: ---
ISBN: 1280744995 9786610744992 1402055714 1402045522 9400787154 Year: 2006 Publisher: Dordrecht : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Book
Theory and Applications of Satisfiability Testing – SAT 2017 : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings
Authors: ---
ISBN: 3319662635 3319662627 Year: 2017 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.

Keywords

Computer science. --- Computer organization. --- Software engineering. --- Operating systems (Computers). --- Computers. --- Numerical analysis. --- Artificial intelligence. --- Computer Science. --- Theory of Computation. --- Artificial Intelligence (incl. Robotics). --- Software Engineering. --- Operating Systems. --- Computer Systems Organization and Communication Networks. --- Numeric Computing. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer operating systems --- Computers --- Disk operating systems --- Computer software engineering --- Organization, Computer --- Informatics --- Operating systems --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Mathematical analysis --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Systems software --- Engineering --- Electronic digital computers --- Science --- Information theory. --- Computer network architectures. --- Electronic data processing. --- Artificial Intelligence. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Office practice --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Communication theory --- Communication --- Automation --- Computer algorithms --- Computer engineering. --- Computer networks. --- Computer Engineering and Networks. --- Numerical Analysis. --- 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 --- Distributed processing --- Design and construction


Book
Theory and applications of satisfiability testing : 8th international conference, SAT 2005, St Andrews, UK, June 19-23, 2005 : proceedings
Authors: --- ---
Year: 2005 Publisher: Berlin ; New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The 8th International Conference on Theory and Applications of Satis?ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis?ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the ?rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis?ability testing has proved to extremely useful in a wide range of di?erent disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most e?ective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools. This volume contains the papers accepted for presentation at SAT 2005. The conference attracted a record number of 73 submissions. Of these, 26 papers were accepted for presentation in the technical programme. In addition, 16 - pers were accepted as shorter papers and were presented as posters during the technicalprogramme.Theacceptedpapersandposterpaperscoverthefullrange of topics listed in the call for papers.

Listing 1 - 4 of 4
Sort by