Results 1 
9 of
9
Unification under a mixed prefix
 Journal of Symbolic Computation
, 1992
"... Unification problems are identified with conjunctions of equations between simply typed λterms where free variables in the equations can be universally or existentially quantified. Two schemes for simplifying quantifier alternation, called Skolemization and raising (a dual of Skolemization), are pr ..."
Abstract

Cited by 132 (14 self)
 Add to MetaCart
(Show Context)
Unification problems are identified with conjunctions of equations between simply typed λterms where free variables in the equations can be universally or existentially quantified. Two schemes for simplifying quantifier alternation, called Skolemization and raising (a dual of Skolemization), are presented. In this setting where variables of functional type can be quantified and not all types contain closed terms, the naive generalization of firstorder Skolemization has several technical problems that are addressed. The method of searching for preunifiers described by Huet is easily extended to the mixed prefix setting, although solving flexibleflexible unification problems is undecidable since types may be empty. Unification problems may have numerous incomparable unifiers. Occasionally, unifiers share common factors and several of these are presented. Various optimizations on the general unification search problem are as discussed. 1.
On the Undecidability of SecondOrder Unification
 INFORMATION AND COMPUTATION
, 2000
"... ... this paper, and it is the starting point for proving some novel results about the undecidability of secondorder unification presented in the rest of the paper. We prove that secondorder unification is undecidable in the following three cases: (1) each secondorder variable occurs at most t ..."
Abstract

Cited by 34 (16 self)
 Add to MetaCart
(Show Context)
... this paper, and it is the starting point for proving some novel results about the undecidability of secondorder unification presented in the rest of the paper. We prove that secondorder unification is undecidable in the following three cases: (1) each secondorder variable occurs at most twice and there are only two secondorder variables; (2) there is only one secondorder variable and it is unary; (3) the following conditions (i)#(iv) hold for some fixed integer n: (i) the arguments of all secondorder variables are ground terms of size <n, (ii) the arity of all secondorder variables is <n, (iii) the number of occurrences of secondorder variables is #5, (iv) there is either a single secondorder variable or there are two secondorder variables and no firstorder variables.
On Equality Upto Constraints over Finite Trees, Context Unification, and OneStep Rewriting
"... We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints. ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints.
Decidable and undecidable secondorder unification problems
 In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA’98), volume 1379 of LNCS
, 1998
"... Abstract. There is a close relationship between word unification and secondorder unification. This similarity has been exploited for instance for proving decidability of monadic secondorder unification. Word unification can be easily decided by transformation rules (similar to the ones applied in ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
(Show Context)
Abstract. There is a close relationship between word unification and secondorder unification. This similarity has been exploited for instance for proving decidability of monadic secondorder unification. Word unification can be easily decided by transformation rules (similar to the ones applied in higherorder unification procedures) when variables are restricted to occur at most twice. Hence a wellknown open question was the decidability of secondorder unification under this same restriction. Here we answer this question negatively by reducing simultaneous rigid Eunification to secondorder unification. This reduction, together with an inverse reduction found by Degtyarev and Voronkov, states an equivalence relationship between both unification problems. Our reduction is in some sense reversible, providing decidability results for cases when simultaneous rigid Eunification is decidable. This happens, for example, for onevariable problems where the variable occurs at most twice (because rigid Eunification is decidable for just one equation). We also prove decidability when no variable occurs more than once, hence significantly narrowing the gap between decidable and undecidable secondorder unification problems with variable occurrence restrictions. 1
Context unification and traversal equations
 In: Proc. of the 12th International Conference on Rewriting Techniques and Applications (RTA’01
, 2001
"... Abstract. Context unification was originally defined by H. Comon in ICALP’92, as the problem of finding a unifier for a set of equations containing firstorder variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are secon ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Context unification was originally defined by H. Comon in ICALP’92, as the problem of finding a unifier for a set of equations containing firstorder variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are secondorder variables that are restricted to be instantiated by linear terms (a linear term is a λexpression λx1 ···λxn.t where every xi occurs exactly once in t). In this paper, we prove that, if the so called rankbound conjecture is true, then the context unification problem is decidable. This is done reducing context unification to solvability of traversal equations (a kind of word unification modulo certain permutations) and then, reducing traversal equations to word equations with regular constraints. 1
Steps Toward a Computational Metaphysics
 JOURNAL OF PHILOSOPHICAL LOGIC
, 2007
"... In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this objects is implemented in prover9 (a firstorder automated reasoning system which is the successor to otter). Afte ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this objects is implemented in prover9 (a firstorder automated reasoning system which is the successor to otter). After reviewing the secondorder, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in prover9’s firstorder syntax, and (2) how prover9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research.
UNIFICATION SOURCETRACKING WITH APPLICATION TO DIAGNOSIS OF TYPE INFERENCE
, 2002
"... ii ..."
(Show Context)
University of California–Berkeley and
"... In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this objects is implemented in prover9 (a firstorder automated reasoning system which is the successor to otter). Afte ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this objects is implemented in prover9 (a firstorder automated reasoning system which is the successor to otter). After reviewing the secondorder, axiomatic theory of abstract objects, we show (1)howtorepresentafragmentofthattheoryinprover9’s firstorder syntax, and (2) how prover9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research. 1.
On the Limits of SecondOrder Unification
"... SecondOrder Unification is a problem that naturally arises when applying automated deduction techniques with variables denoting predicates. The problem is undecidable, but a considerable effort has been made in order to find decidable fragments, and understand the deep reasons of its complexity. Tw ..."
Abstract
 Add to MetaCart
SecondOrder Unification is a problem that naturally arises when applying automated deduction techniques with variables denoting predicates. The problem is undecidable, but a considerable effort has been made in order to find decidable fragments, and understand the deep reasons of its complexity. Two variants of the problem, Bounded SecondOrder Unification and Linear SecondOrder Unification –where the use of bound variables in the instantiations is restricted–, have been extensively studied in the last two decades. In this paper we summarize some decidability/undecidability/complexity results, trying to focus on those that could be more interesting for a wider audience, and involving less technical details. 1