Knowledge Representation, Reasoning and Declarative Problem Solving (häftad)
Häftad (Paperback)
Antal sidor
Cambridge University Press
black & white illustrations
247 x 171 x 38 mm
884 g
Antal komponenter
67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam

Knowledge Representation, Reasoning and Declarative Problem Solving

Häftad, Engelska, 2010-05-27
524 kr
Skickas inom 7-10 vardagar.
Fri frakt inom Sverige för privatpersoner.
Knowledge management and knowledge-based intelligence are areas of importance in the economy and society, and to exploit them fully and efficiently it is necessary both to represent and reason about knowledge via a declarative interface whose input language is based on logic. In this book, originally published in 2003, Chitta Baral shows exactly how to go about doing that: how to write programs that behave intelligently by giving them the ability to express knowledge and reason about it. He presents a language, AnsProlog, for both knowledge representation and reasoning, and declarative problem solving. The results have been organised here into a form that will appeal to practising and would-be knowledge engineers wishing to learn more about the subject, either in courses or through self-teaching. A comprehensive bibliography rounds off the book.
Visa hela texten


Har du läst boken? Sätt ditt betyg »

Recensioner i media

Review of the hardback: 'I wholeheartedly recommend this book to researchers and students in the fields of logic programming, declarative programming and knowledge representation.' Journal of Transport, Law and Policy

Review of the hardback: '... the appearance of an extensive book with such a deep theoretical content and with analyses, methods and examples useful for practical applications is admirable after the very short history of Answer Set Programming.' Zentralblatt MATH

Bloggat om Knowledge Representation, Reasoning and D...


Preface; 1. Declarative programming in AnsProlog*: introduction and preliminaries; 2. Simple modules for declarative programming with answer sets; 3. Principles and properties of declarative programming with answer sets; 4. Declarative problem solving and reasoning in AnsProlog*; 5. Reasoning about actions and planning in AnsProlog*; 6. Complexity, expressiveness, and other properties of AnsProlog* programs; 7. Answer set computing algorithms; 8. Query answering and answer set computing systems; 9. Further extensions of and alternatives to AnsProlog*; 10. Appendix A: Ordinals, lattices, and fixpoint theory; 11. Appendix B: Turing machines; Bibliography; Index of notation; Index of terms.