Complexity, expressiveness, and other properties of AnsProlog* programs
Lists
Only you see this
Abstract
Earlier in Chapter 3 we discussed several results and properties of AnsProlog* programs that are useful in analyzing and step-by-step building of these programs. In this chapter we consider some broader properties that help answer questions such as: (a) how difficult is it to compute answer sets of various sub-classes of AnsProlog*? (b) how expressive are the various sub-classes of AnsProlog*? (c) does the use of AnsProlog* lead to compact representation or can it be compiled to a more tractable representation? and (d) what is the relationship between AnsProlog* and other knowledge representation formalisms?
BibTeX
@inproceedings{baral2003complexity,
author = {Chitta Baral},
title = {{Complexity, expressiveness, and other properties of AnsProlog<sup>*</sup> programs}},
booktitle = {Cambridge},
year = {2003},
doi = {10.1017/cbo9780511543357.007},
}Loading related content...