Chapter

Rules on the Web. From Theory to Applications

Volume 8620 of the series Lecture Notes in Computer Science pp 97-111

Checking Termination of Logic Programs with Function Symbols through Linear Constraints

  • Marco CalauttiAffiliated withDIMES, Università della Calabria
  • , Sergio GrecoAffiliated withDIMES, Università della Calabria
  • , Cristian MolinaroAffiliated withDIMES, Università della Calabria
  • , Irina TrubitsynaAffiliated withDIMES, Università della Calabria

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Enriching answer set programming with function symbols makes modeling easier, increases the expressive power, and allows us to deal with infinite domains. However, this comes at a cost: common inference tasks become undecidable. To cope with this issue, recent research has focused on finding trade-offs between expressivity and decidability by identifying classes of logic programs that impose limitations on the use of function symbols but guarantee decidability of common inference tasks. Despite the significant body of work in this area, current approaches do not include many simple practical programs whose evaluation terminates. In this paper, we present the novel class of rule-bounded programs. While current techniques perform a limited analysis of how terms are propagated from an individual argument to another, our technique is able to perform a more global analysis, thereby overcoming several limitations of current approaches. We also present a further class of cycle-bounded programs where groups of rules are analyzed together. We show different results on the correctness and the expressivity of the proposed techniques.

Keywords

Logic programming with function symbols bottom-up evaluation program evaluation termination stable models