Using linear constraints for logic program termination analysis

Greco, Sergio; Molinaro, Cristian; Trubitsyna, Irina

doi:10.1017/s1471068416000077

Cited by 2 publications

(2 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The class of rule-bounded programs has been proposed in [Calautti et al 2016b;2015a] and relies on the use of linear inequalities to compute the sizes of terms and atoms. The criterion uses this information and checks if the size of the head atom of a (recursive) rule is always bounded by the size of a body atom.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

Greco

Trubitsyna

2017

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

In this article, we propose a new technique for checking whether the bottom-up evaluation of logic programs with function symbols terminates. The technique is based on the definition of mappings from arguments to strings of function symbols, representing possible values which could be taken by arguments during the bottom-up evaluation. Starting from mappings, we identify mapping-restricted arguments, a subset of limited arguments, namely arguments that take values from finite domains. Mapping-restricted programs, consisting of rules whose arguments are all mapping restricted, are terminating under the bottom-up computation, as all of its arguments take values from finite domains. We show that mappings can be computed by transforming the original program into a unary logic program: this allows us to establish decidability of checking if a program is mapping restricted. We study the complexity of the presented approach and compare it to other techniques known in the literature. We also introduce an extension of the proposed approach that is able to recognize a wider class of logic programs. The presented technique provides a significant improvement, as it can detect terminating programs not identified by other criteria proposed so far. Furthermore, it can be combined with other techniques to further enlarge the class of programs recognized as terminating under the bottom-up evaluation.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Rule-bounded programs. [Calautti et al 2016b] The class of rule-bounded programs, denoted with RB, relies on the use of linear inequalities to measure terms and atoms' sizes and check if the size of the head of a (recursive) rule is always bounded by the size of a body atom.…”

Section: Termination Criteriamentioning

confidence: 99%