Computing only minimal answers in disjunctive deductive databases
| dc.creator | Johnson, C. A. | |
| dc.date | 2003-05-13 | |
| dc.date.accessioned | 2026-07-07T03:19:39Z | |
| dc.date.available | 2026-07-07T03:19:39Z | |
| dc.description | A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), whence no non-minimal answer is generated. For stratified databases, the method does not (necessarily) require the computation of models of the database in their entirety. Compilation is proposed as a tool by which problems relating to computational efficiency and the non-existence of disjunctive stable models can be overcome. The extension of our method to other semantics is also considered. | |
| dc.description | 48 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0305007 | |
| dc.identifier | http://arxiv.org/abs/cs/0305007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31547 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F4.1 | |
| dc.title | Computing only minimal answers in disjunctive deductive databases | |
| dc.type | text |