Enriching Datalog programs 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 show different results on the correctness and the expressivity of the proposed technique.

Checking Termination of Datalog with Function Symbols Through Linear Constraints / M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna - In: 23rd Italian Symposium on Advanced Database Systems, SEBD 2015,Gaeta, Italy, June 14-17, 2015 / [a cura di] Domenico Lembo and Riccardo Torlone and Andrea Marrella. - Red Hook, New York : Curran Associates, Inc., 2015. - ISBN 9781510810877. - pp. 192-199 (( Intervento presentato al 23. convegno 23rd Italian Symposium on Advanced Database Systems, SEBD 2015 tenutosi a Gaeta nel 14th -17th June 2015.

Checking Termination of Datalog with Function Symbols Through Linear Constraints

M. Calautti;
2015

Abstract

Enriching Datalog programs 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 show different results on the correctness and the expressivity of the proposed technique.
Datalog with function symbols; bottom-up evaluation; program evaluation termination
Settore INF/01 - Informatica
2015
Book Part (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/953312
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact