Using linear constraints for logic program termination analysis

DOI10.1017/S1471068416000077zbMath1379.68050arXiv1512.04097OpenAlexW3104721040MaRDI QIDQ4593032

Marco Calautti, Sergio Greco, Irina Trubitsyna, Cristian Molinaro

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.04097

zbMATH Keywords

answer set programmingfunction symbolsstable modelsbottom-up evaluationprogram evaluation termination

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• NP Datalog
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning with infinite stable models
• Matrix interpretations for proving termination of term rewriting
• Termination of narrowing via termination of rewriting
• Testing logic programs for local stratification
• Complexity of the unification algorithm for first-order expressions
• Total termination of term rewriting
• Termination of term rewriting using dependency pairs
• Fast offline partial evaluation of logic programs
• Incomplete Data and Data Dependencies in Relational Databases
• Automated termination proofs for logic programs by term rewriting
• Terminating Evaluation of Logic Programs with Finite Three-Valued Models
• Non-termination analysis of logic programs with integer arithmetics
• On termination of meta-programs
• Root-Labeling
• atalog: A logic language for expressing search and optimization problems
• Automated termination analysis for logic programs with cut
• Disjunctive ASP with functions: Decidable queries and effective computation
• On finitely recursive programs
• On the complexity of integer programming
• Termination of logic programs: the never-ending story
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• One More Decidable Class of Finitely Ground Programs
• On the Termination of Logic Programs with Function Symbols
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
• Logic Programming
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Computable Functions in ASP: Theory and Implementation
• Termination proofs for logic programs with tabling
• Termination of logic programs: Transformational methods revisited

This page was built for publication: Using linear constraints for logic program termination analysis