Gilles Dowek. A unification algorithm for second-order linear terms. Available at http://pauillac.inria.fr/~dowek/linear.ps.gz, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Simple Deduction System for First-Order Logic with.. - Goubault-Larrecq (1999) (Correct)
....of any existential variable X S to a fresh existential variable X S i , i 0. Then define P ] K) as true if and only if (K) is satisfiable. This is clearly an upper approximation. Moreover, we conjecture that P ] is a decidable predicate, much like linear second order unification [Dow93] 5 Structural Induction We now wish to consider some sorts as inductive. For example, we wish to consider nat as the smallest set of ground terms containing O and such that S(t) 2 nat whenever t 2 nat. 41 To this end, we first extend Definition 1.1 so as to mark all sorts that we wish to ....
Gilles Dowek. A unification algorithm for second-order linear terms. Available at http://pauillac.inria.fr/~dowek/linear.ps.gz, 1993.
Tractable and Intractable Second-Order Matching Problems - Hirata, Yamada, Harao (1999) (6 citations) (Correct)
.... analogical reasoning, and machine learning [4, 5, 9, 13, 14] It is well known that the second order unification problem is undecidable [12] and various researchers have separated decidable from undecidable unification problems by introducing several restrictions of a unification expression [1, 6, 7, 8, 11, 12, 15, 16, 17]. It is also well known that the second order matching problem is NP complete [2] Huet and Lang [14] have designed a complete and nonredundant second order matching algorithm. However, there exist few researches to analyze deeply the complexity of the matching problem. It is one of the reason ....
....Veanes [17] have shown that the unification problem is undecidable for an 1 fv ground and an 1 fv unary unification expressions. Whether the corresponding matching problems are NP complete is still open. 6. A matching expression is k linear if any function variable occurs at most k times. Dowek [6] has shown that the unification problem is decidable for an 1linear unification expression, and the matching problem is solvable in linear time for an 1 linear matching expression. Furthermore, Levy [16] has shown that the unification problem is undecidable for a 2 linear unification expression. ....
[Article contains additional citation context not shown here]
Dowek, G.: A unification algorithm for second-order linear terms, manuscript, 1993, also available at http://coq.inria.fr/~dowek/.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC