OpenAlex
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
Work
Year: 2017
Type: article
Abstract: 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 ... more
Cites: 60
Cited by: 5
Related to: 10
FWCI: 0.567
Citation percentile (by year/subfield): 74
Open Access status: green