Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 183-205) and index.

List of figures -- List of tables -- List of lists -- List of algorithms -- Preface -- About this book --

1. Motivation -- 1.1 Quickstart -- 1.2 References and further reading --

2. Introduction -- 2.1 Logical preliminaries and terminology -- 2.2 Basic syntax and semantics -- 2.3 Language extensions -- 2.3.1 First-order variables -- 2.3.2 Core language -- 2.3.3 Optimization statements -- 2.3.4 Two (and a half ) kinds of negation -- 2.3.5 True language extensions -- 2.4 Computational aspects -- 2.4.1 Computation from first principles -- 2.4.2 Reasoning modes -- 2.4.3 Computational complexity -- 2.5 References and further reading --

3. Basic modeling -- 3.1 Problem encoding -- 3.2 Modeling methodology -- 3.3 Advanced problem encoding -- 3.4 References and further reading --

4. Grounding -- 4.1 Basic grounding algorithms -- 4.2 Turing machine -- 4.3 Meta programming -- 4.4 References and further reading --

5. Characterizations -- 5.1 Axiomatic characterization -- 5.2 Operational characterization -- 5.3 Proof-theoretic characterization -- 5.4 Nogood-based characterization -- 5.5 References and further reading --

6. Solving -- 6.1 Boolean constraint solving -- 6.2 Setting the stage -- 6.3 Conflict-driven nogood learning -- 6.4 Nogood propagation -- 6.5 Unfounded set checking -- 6.6 Conflict analysis -- 6.7 References and further reading --

7. Systems -- 7.1 Grounding with gringo -- 7.1.1 Architecture -- 7.1.2 Gringo's input language -- 7.1.3 Making grounding more transparent -- 7.1.4 The smodels format -- 7.1.5 Outlook -- 7.2 Solving with clasp -- 7.2.1 Interfaces and preprocessing -- 7.2.2 Reasoning modes -- 7.2.3 Propagation and search -- 7.2.4 Multi-threaded architecture -- 7.2.5 Making solving more transparent -- 7.2.6 Fine-tuning -- 7.2.7 Outlook -- 7.3 More Potassco systems -- 7.3.1 claspd -- 7.3.2 claspar -- 7.3.3 claspfolio -- 7.3.4 clingo -- 7.3.5 clingcon -- 7.3.6 iclingo -- 7.3.7 oclingo -- 7.4 References and further reading --

8. Advanced modeling -- 8.1 Pimping queens -- 8.2 Stemming blocks -- 8.2.1 Sequential planning -- 8.2.2 Parallel planning -- 8.3 Speeding salesmen -- 8.4 Vade mecum gum -- 8.5 References and further reading --

9. Conclusions -- 9.1 Omissions -- 9.2 Challenges -- 9.3 Arming Tweety with jet engines --

A. ASP in a nutshell -- Bibliography -- Index.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

Answer set programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of knowledge representation and reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP's solving technology, modeling language and methodology, while illustrating the overall solving process by practical examples.

Also available in print.

Title from PDF t.p. (viewed on January 18, 2013).