## Knowledge Representation, Reasoning and Declarative Problem SolvingKnowledge 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

Chapter 2 Simple modules for declarative programming with answer sets | 46 |

Chapter 3 Principles and properties of declarative programming with answer sets | 83 |

Chapter 4 Declarative problem solving and reasoning in AnsProlog | 170 |

Chapter 5 Reasoning about actions and planning in AnsProlog | 199 |

Chapter 6 Complexity expressiveness and other properties of AnsProlog programs | 278 |

Chapter 7 Answer set computing algorithms | 345 |

Chapter 8 Query answering and answer set computing systems | 382 |

Chapter 9 Further extensions of and alternatives to AnsProlog | 458 |

Ordinals lattices and fixpoint theory | 494 |

Turing machines | 496 |

498 | |

519 | |

522 | |

### Other editions - View all

Knowledge Representation, Reasoning and Declarative Problem Solving Chitta Baral No preview available - 2003 |

Knowledge Representation, Reasoning and Declarative Problem Solving Chitta Baral No preview available - 2010 |

### Common terms and phrases

ab(F abductive abductive reasoning acyclic algorithm AnsDatalog AnsProlog program AnsProlog¬,or program AnsPrologsm autoepistemic autoepistemic logic body Chapter complete complexity class Consider the following consistent answer set consistent domain description constraints database default default logic define Definition denoted description logic disjunction effect propositions encoding entailment enumeration equivalent Example executability conditions existsatisfied expressed EXPTIME false fixpoint fluent literal following program following rules formula given graph Hence Herbrand Base Herbrand model holds holds(F holds(loaded initial input interpolation Intuitively knowledge representation Lemma logic programming naf-literals notation notion NP-complete planning polynomial polynomial hierarchy predicates problem program in AnsProlog PROLOG Proof propositional logic PSPACE Pure PROLOG query reasoning referred res(A satisfy Section sequence set of atoms set of literals set of observations sets of AnsProlog specification stratified sub-classes subset Theorem theory translation true with respect truth value tuple unique answer set variables well-founded semantics