Checking termination of bottom-up evaluation of logic programs with function symbols
From MaRDI portal
Publication:4593017
DOI10.1017/S1471068414000623zbMath1379.68051arXiv1407.2106OpenAlexW2135520900MaRDI QIDQ4593017
Irina Trubitsyna, Francesca Spezzano, Marco Calautti, Sergio Greco
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/1407.2106
Related Items (3)
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ Using linear constraints for logic program termination analysis ⋮ What is answer set programming to propositional satisfiability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7--13, 2012. Proceedings
- Data exchange: semantics and query answering
- Reasoning with infinite stable models
- Matrix interpretations for proving termination of term rewriting
- Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15--17, 2008. Proceedings
- Termination of narrowing via termination of rewriting
- Complexity of the unification algorithm for first-order expressions
- Extending and implementing the stable model semantics
- Logics in artificial intelligence. 8th European conference, JELIA 2002, Cosenza, Italy, September 23--26, 2002. Proceedings
- Total termination of term rewriting
- A framework for testing safety and effective computability
- Algebraic methodology and software technology. 5th international conference, AMAST '96, Munich, Germany, July 1-5, 1996. Proceedings
- Termination of term rewriting using dependency pairs
- Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
- Automated termination proofs for logic programs by term rewriting
- Non-termination Analysis of Logic Programs Using Types
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
- On the power of magic
- On termination of meta-programs
- The Dependency Triple Framework for Termination of Logic Programs
- Automated termination analysis for logic programs with cut
- Disjunctive ASP with functions: Decidable queries and effective computation
- On finitely recursive programs
- Termination of logic programs: the never-ending story
- One More Decidable Class of Finitely Ground Programs
- On the Termination of Logic Programs with Function Symbols
- A practical analysis of non-termination in large logic programs
- Logic Programming
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Computable Functions in ASP: Theory and Implementation
- Optimization of bound disjunctive queries with constraints
- Termination of logic programs: Transformational methods revisited
This page was built for publication: Checking termination of bottom-up evaluation of logic programs with function symbols