Declarative problem solving and reasoning in AnsProlog*

Chitta BaralCambridge 2003 · DOI · OpenAlex

Abstract

In this chapter we formulate several knowledge representation and problem solving domains using AnsProlog*. Our focus in this chapter is on program development. We start with three well known problems from the literature of constraint satisfaction, and automated reasoning: placing queens on a chess board, determining who owns the zebra, and finding tile covering in a mutilated chess board. We show several encodings of these problems using AnsProlog*. We then discuss a general methodology for representing constraint satisfaction problems (CSPs) and show how to extend it to dynamic CSPs. We then present encodings of several combinatorial graph problems such as k-colorability, Hamiltonian circuit, and k-clique. After discussing these problem solving examples, we present a general methodology of reasoning with prioritized defaults, and show how reasoning with inheritance hierarchies is a special case of this.
BibTeX
@inproceedings{baral2003declarative,
  author = {Chitta Baral},
  title = {{Declarative problem solving and reasoning in AnsProlog<sup>*</sup>}},
  booktitle = {Cambridge},
  year = {2003},
  doi = {10.1017/cbo9780511543357.005},
}

Loading related content...

Figure