Representation Theory for Default Logic
| dc.creator | Marek, Victor | |
| dc.creator | Treur, Jan | |
| dc.creator | Truszczynski, Miroslaw | |
| dc.date | 1999-01-28 | |
| dc.date.accessioned | 2026-07-07T03:23:55Z | |
| dc.date.available | 2026-07-07T03:23:55Z | |
| dc.description | Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of extensions of a default theory. We give a complete solution to the representability by means of normal default theories. We obtain partial results on representability by arbitrary default theories. We construct examples of denumerable families of non-including theories that are not representable. We also study the concept of equivalence between default theories. | |
| dc.description | Annals of Mathematics and Artificial Intelligence, 21 (1997), pp. 343-358 | |
| dc.identifier | https://arxiv.org/abs/cs/9901016 | |
| dc.identifier | http://arxiv.org/abs/cs/9901016 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33133 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.4, F.4.1, I.2.3 | |
| dc.title | Representation Theory for Default Logic | |
| dc.type | text |