Logic Programming
From MaRDI portal
(Redirected from Publication:5475787)
Logic Programming (scientific article; zbMATH DE number 5036426)
Logic Programming (scientific article; zbMATH DE number 5036426)
Recommendations
- Size-Change Termination, Monotonicity Constraints and Ranking Functions
- Size-change termination, monotonicity constraints and ranking functions
- SAT-based termination analysis using monotonicity constraints over the integers
- Monotonicity constraints for termination in the integer domain
- The size-change principle for program termination
Cited in
(17)- A complexity tradeoff in ranking-function termination proofs
- A second-order formulation of non-termination
- Fast offline partial evaluation of logic programs
- Monadic Sequence Testing and Explicit Test-Refinements
- Terminating evaluation of logic programs with finite three-valued models
- Dependency triples for improving termination analysis of logic programs with cut
- SAT-based termination analysis using monotonicity constraints over the integers
- Testing Monotone Read-Once Functions
- Monotonicity constraints for termination in the integer domain
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Using linear constraints for logic program termination analysis
- scientific article; zbMATH DE number 1418269 (Why is no real title available?)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Monotonicity Analysis Can Speed Up Verification
- Ranking functions for linear-constraint loops
- Size-change termination, monotonicity constraints and ranking functions
- Size-Change Termination, Monotonicity Constraints and Ranking Functions
This page was built for publication: Logic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475787)