Automatically Proving and Disproving Feasibility Conditions (Q5049020): Difference between revisions

@@ Property / describes a project that uses @@
+Prover9
@@ Property / describes a project that uses: Prover9 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Mace4
@@ Property / describes a project that uses: Mace4 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ConCon
@@ Property / describes a project that uses: ConCon / 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-030-51054-1_27
+Normal rank
@@ Property / OpenAlex ID @@
+W3040061435
@@ Property / OpenAlex ID: W3040061435 / rank @@
+Normal rank
@@ Property / cites work @@
+Over-approximating terms reachable by context-sensitive rewriting
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanizing and improving dependency pairs
@@ Property / cites work: Mechanizing and improving dependency pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3030249
@@ Property / cites work: Q3030249 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of logical models with AGES
@@ Property / cites work: Automatic generation of logical models with AGES / rank @@
+Normal rank
@@ Property / cites work @@
+Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Analysis of rewriting-based systems as first-order theories
+Normal rank
@@ Property / cites work @@
+Q4259966
@@ Property / cites work: Q4259966 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving semantic properties as first-order satisfiability
+Normal rank
@@ Property / cites work @@
+Using well-founded relations for proving operational termination
+Normal rank
@@ Property / cites work @@
+Use of logical models for proving infeasibility in term rewriting
+Normal rank
@@ Property / cites work @@
+Operational termination of conditional term rewriting systems
+Normal rank
@@ Property / cites work @@
+The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
+Normal rank
@@ Property / cites work @@
+The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
+Normal rank
@@ Property / cites work @@
+Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5559220
@@ Property / cites work: Q5559220 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability Analysis for Termination and Confluence of Rewriting
+Normal rank
@@ Property / cites work @@
+MædMax: a maximal ordered completion tool
@@ Property / cites work: MædMax: a maximal ordered completion tool / rank @@
+Normal rank