Automatic generation of logical models with AGES (Q2305421): Difference between revisions

@@ Property / describes a project that uses @@
+Mace4
@@ Property / describes a project that uses: Mace4 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Prover9
@@ Property / describes a project that uses: Prover9 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Maude
@@ Property / describes a project that uses: Maude / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+FALCON
@@ Property / describes a project that uses: FALCON / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Yices
@@ Property / describes a project that uses: Yices / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+z3
@@ Property / describes a project that uses: z3 / 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-29436-6_17
+Normal rank
@@ Property / OpenAlex ID @@
+W2969868654
@@ Property / OpenAlex ID: W2969868654 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Termination Properties with mu-term
@@ Property / cites work: Proving Termination Properties with mu-term / rank @@
+Normal rank
@@ Property / cites work @@
+Q2958378
@@ Property / cites work: Q2958378 / rank @@
+Normal rank
@@ Property / cites work @@
+All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
+Normal rank
@@ Property / cites work @@
+Matrix interpretations for proving termination of term rewriting
+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 @@
+Using well-founded relations for proving operational termination
+Normal rank
@@ Property / cites work @@
+Proving program properties as first-order satisfiability
+Normal rank
@@ Property / cites work @@
+Automatic synthesis of logical models for order-sorted first-order theories
+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 @@
+Dependency pairs for proving termination properties of conditional term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+Logic of many-sorted theories
@@ Property / cites work: Logic of many-sorted theories / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing finite algebras with FALCON
@@ Property / cites work: Constructing finite algebras with FALCON / rank @@
+Normal rank
@@ Property / cites work @@
+System description generating models by SEM
@@ Property / cites work: System description generating models by SEM / rank @@
+Normal rank