Verifying Termination of General Logic Programs with Concrete Queries
| dc.creator | Shen, Yi-Dong | |
| dc.creator | Yuan, Li-Yan | |
| dc.creator | You, Jia-Huai | |
| dc.date | 2000-06-21 | |
| dc.date.accessioned | 2026-07-07T03:16:18Z | |
| dc.date.available | 2026-07-07T03:16:18Z | |
| dc.description | We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is established and an algorithm for automatic verification is developed. In contrast to existing query pattern-based approaches, our method has the following features: (1) It applies to all general logic programs with non-floundering queries. (2) It is very easy to automate because it does not need to search for a level mapping or a model, nor does it need to compute an interargument relation based on additional mode or type information. (3) It bridges termination analysis with loop checking, the two problems that have been studied separately in the past despite their close technical relation with each other. | |
| dc.description | 28 pages, 8 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0006031 | |
| dc.identifier | http://arxiv.org/abs/cs/0006031 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30302 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.3.1; F.4.1; I.2.3 | |
| dc.title | Verifying Termination of General Logic Programs with Concrete Queries | |
| dc.type | text |