| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
27 April 2024 |
|
| | | |
|
Article overview
| |
|
A Dynamic Approach to Characterizing Termination of General Logic Programs | Yi-Dong Shen
; Jia-Huai You
; Li-Yan Yuan
; Samuel S. P. Shen
; Qiang Yang
; | Date: |
12 Apr 2002 | Journal: | ACM Transactions on Computational Logic 4(4):417-430, 2003 | Subject: | Logic in Computer Science; Programming Languages ACM-class: D.1.6;D.1.2;F.4.1 | cs.LO cs.PL | Abstract: | We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach which employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs. | Source: | arXiv, cs.LO/0204031 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |