Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
From MaRDI portal
Publication:5398308
DOI10.1017/S147106841300046XzbMath1286.68045WikidataQ62047414 ScholiaQ62047414MaRDI QIDQ5398308
Cristian Molinaro, Sergio Greco, Irina Trubitsyna
Publication date: 27 February 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
stable modelsbottom-up evaluationlogic programming with function symbolsprogram evaluation termination
Related Items (3)
Using linear constraints for logic program termination analysis ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
Cites Work
- Data exchange: semantics and query answering
- Reasoning with infinite stable models
- Matrix interpretations for proving termination of term rewriting
- Termination of narrowing via termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
- Total termination of term rewriting
- Termination of term rewriting using dependency pairs
- Incomplete Data and Data Dependencies in Relational Databases
- Non-termination analysis of logic programs with integer arithmetics
- On termination of meta-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: Transformational methods revisited
This page was built for publication: Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
