Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590): Difference between revisions

@@ Property / describes a project that uses @@
+TPDB
@@ Property / describes a project that uses: TPDB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AProVE
@@ Property / describes a project that uses: AProVE / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-78769-3_2
+Normal rank
@@ Property / OpenAlex ID @@
+W2111739714
@@ Property / OpenAlex ID: W2111739714 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+An analysis of loop checking mechanisms for logic programs
+Normal rank
@@ Property / cites work @@
+Norms on terms and their use in proving universal termination of a logic program
+Normal rank
@@ Property / cites work @@
+A semantic basis for the termination analysis of logic programs
+Normal rank
@@ Property / cites work @@
+Mechanically proving termination using polynomial interpretations
+Normal rank
@@ Property / cites work @@
+Q5688890
@@ Property / cites work: Q5688890 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4707739
@@ Property / cites work: Q4707739 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+A general framework for automatic termination analysis od logic programs
+Normal rank
@@ Property / cites work @@
+Matrix Interpretations for Proving Termination of Term Rewriting
+Normal rank
@@ Property / cites work @@
+SAT Solving for Termination Analysis with Polynomial Interpretations
+Normal rank
@@ Property / cites work @@
+Modular termination proofs for rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Mechanizing and improving dependency pairs
@@ Property / cites work: Mechanizing and improving dependency pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Automating the dependency pair method
@@ Property / cites work: Automating the dependency pair method / rank @@
+Normal rank
@@ Property / cites work @@
+Testing positiveness of polynomials
@@ Property / cites work: Testing positiveness of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4494366
@@ Property / cites work: Q4494366 / rank @@
+Normal rank
@@ Property / cites work @@
+The size-change principle for program termination
@@ Property / cites work: The size-change principle for program termination / rank @@
+Normal rank
@@ Property / cites work @@
+cTI: a constraint-based termination inference tool for ISO-Prolog
+Normal rank
@@ Property / cites work @@
+Logic Programming
@@ Property / cites work: Logic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Termination proofs for logic programs
@@ Property / cites work: Termination proofs for logic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Transition Invariants and Transition Predicate Abstraction for Program Termination
+Normal rank
@@ Property / cites work @@
+Automated Termination Analysis for Logic Programs by Term Rewriting
+Normal rank
@@ Property / cites work @@
+The size-change principle and dependency pairs for termination of term rewriting
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5504590