Unification in pseudo-linear sort theories is decidable (Q4647533): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61511-3_99
+Normal rank
@@ Property / OpenAlex ID @@
+W1562994860
@@ Property / OpenAlex ID: W1562994860 / rank @@
+Normal rank
@@ Property / cites work @@
+Equality and disequality constraints on direct subterms in tree automata
+Normal rank
@@ Property / cites work @@
+Pumping, cleaning and symbolic constraints solving
+Normal rank
@@ Property / cites work @@
+Inductive proofs by specification transformations
@@ Property / cites work: Inductive proofs by specification transformations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of an order-sorted logic with term declarations
+Normal rank
@@ Property / cites work @@
+Unification theory
@@ Property / cites work: Unification theory / rank @@
+Normal rank
@@ Property / cites work @@
+Unification in sort theories and its applications
@@ Property / cites work: Unification in sort theories and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4860657
@@ Property / cites work: Q4860657 / rank @@
+Normal rank