Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
Knowledge management and knowledge-based intelligence are areas of importance in today's economy and society, and their exploitation requires representation via the development of a declarative interface whose input language is based on logic. Chitta Baral demonstrates 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. Many of the results have never appeared before in book form but are organized here for those wishing to learn more about the subject, either in courses or through self-study.Read more
- First book in 2003 on knowledge representation and reasoning using logic programming, and integrates them with declarative problem solving
- Many executable, declarative programs; a website will contain models and dlv code
- Comprehensive coverage of declarative logic programming with lots of small examples, model computation algorithms, system descriptions, and several application developments
Reviews & endorsements
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 PolicySee more reviews
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
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2010
- format: Paperback
- isbn: 9780521147750
- length: 548 pages
- dimensions: 244 x 170 x 28 mm
- weight: 0.86kg
- availability: Available
Table of Contents
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
Index of notation
Index of terms.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×