| 000 | 05395nam a2200673 i 4500 | ||
|---|---|---|---|
| 001 | 6813208 | ||
| 003 | IEEE | ||
| 005 | 20200413152908.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 130118s2013 caua foab 001 0 eng d | ||
| 020 | _a9781608459728 (electronic bk.) | ||
| 020 | _z9781608459711 (pbk.) | ||
| 024 | 7 |
_a10.2200/S00457ED1V01Y201211AIM019 _2doi |
|
| 035 | _a(CaBNVSL)swl00401999 | ||
| 035 | _a(OCoLC)823389942 | ||
| 040 |
_aCaBNVSL _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.615 _b.A588 2013 |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 245 | 0 | 0 |
_aAnswer set solving in practice _h[electronic resource] / _cMartin Gebser ... [et al.]. |
| 260 |
_aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : _bMorgan & Claypool, _cc2013. |
||
| 300 |
_a1 electronic text (xxv, 212 p.) : _bill., digital file. |
||
| 490 | 1 |
_aSynthesis lectures on artificial intelligence and machine learning, _x1939-4616 ; _v# 19 |
|
| 538 | _aMode of access: World Wide Web. | ||
| 538 | _aSystem requirements: Adobe Acrobat Reader. | ||
| 500 | _aPart of: Synthesis digital library of engineering and computer science. | ||
| 500 | _aSeries from website. | ||
| 504 | _aIncludes bibliographical references (p. 183-205) and index. | ||
| 505 | 0 | _aList of figures -- List of tables -- List of lists -- List of algorithms -- Preface -- About this book -- | |
| 505 | 8 | _a1. Motivation -- 1.1 Quickstart -- 1.2 References and further reading -- | |
| 505 | 8 | _a2. 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 -- | |
| 505 | 8 | _a3. Basic modeling -- 3.1 Problem encoding -- 3.2 Modeling methodology -- 3.3 Advanced problem encoding -- 3.4 References and further reading -- | |
| 505 | 8 | _a4. Grounding -- 4.1 Basic grounding algorithms -- 4.2 Turing machine -- 4.3 Meta programming -- 4.4 References and further reading -- | |
| 505 | 8 | _a5. 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 -- | |
| 505 | 8 | _a6. 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 -- | |
| 505 | 8 | _a7. 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 -- | |
| 505 | 8 | _a8. 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 -- | |
| 505 | 8 | _a9. Conclusions -- 9.1 Omissions -- 9.2 Challenges -- 9.3 Arming Tweety with jet engines -- | |
| 505 | 8 | _aA. ASP in a nutshell -- Bibliography -- Index. | |
| 506 | 1 | _aAbstract freely available; full-text restricted to subscribers or individual document purchasers. | |
| 510 | 0 | _aCompendex | |
| 510 | 0 | _aINSPEC | |
| 510 | 0 | _aGoogle scholar | |
| 510 | 0 | _aGoogle book search | |
| 520 | 3 | _aAnswer 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. | |
| 530 | _aAlso available in print. | ||
| 588 | _aTitle from PDF t.p. (viewed on January 18, 2013). | ||
| 650 | 0 | _aDeclarative programming. | |
| 650 | 0 | _aLogic programming. | |
| 650 | 0 | _aKnowledge representation (Information theory) | |
| 653 | _aanswer set programming | ||
| 653 | _adeclarative problem solving | ||
| 653 | _alogic programming | ||
| 700 | 1 | _aGebser, Martin. | |
| 776 | 0 | 8 |
_iPrint version: _z9781608459711 |
| 830 | 0 | _aSynthesis digital library of engineering and computer science. | |
| 830 | 0 |
_aSynthesis lectures on artificial intelligence and machine learning ; _v# 19. _x1939-4616 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6813208 |
| 999 |
_c561953 _d561953 |
||