Results 251 to 260 of about 384,748 (295)
The Formation and Evolution of the Japan Primary Care Association: A 15-Year Retrospective. [PDF]
Matsumura S, Amenomori M, Kusaba T.
europepmc +1 more source
Implications of Stimulation Modality and Control Condition on BOLD Response: An Example From the MOUS Dataset. [PDF]
Schuler AL, Teuscher E, Filippini N.
europepmc +1 more source
Intensive care medicine: Is this the time to unify our professional organisations? [PDF]
Akhtar W, Bakare S.
europepmc +1 more source
Generalizations of Unification
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alessandro Berarducci
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Automated Reasoning, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Journal of Functional Programming, 1998
Unification, or two-way pattern matching, is the process of solving an equation involving two first-order terms with variables. Unification is used in type inference in many programming languages and in the execution of logic programs. This means that unification algorithms have to be written over and over again for different term types.
Patrik Jansson, Johan Jeuring
openaire +2 more sources
Unification, or two-way pattern matching, is the process of solving an equation involving two first-order terms with variables. Unification is used in type inference in many programming languages and in the execution of logic programs. This means that unification algorithms have to be written over and over again for different term types.
Patrik Jansson, Johan Jeuring
openaire +2 more sources
Information Processing Letters, 1982
This paper presents a generalization of the concept of unification introduced by \textit{J. A. Robinson} [J. Assoc. Math. 12, 23-41 (1965; Zbl 0139.123)] for resolution logic. Unification is the central procedure for performing manipulation of symbolic structures in resolution theorem proving.
Jan Maluszynski, Jørgen Fischer Nilsson
openaire +2 more sources
This paper presents a generalization of the concept of unification introduced by \textit{J. A. Robinson} [J. Assoc. Math. 12, 23-41 (1965; Zbl 0139.123)] for resolution logic. Unification is the central procedure for performing manipulation of symbolic structures in resolution theorem proving.
Jan Maluszynski, Jørgen Fischer Nilsson
openaire +2 more sources
Synthese, 2002
In this article we criticize two recent articles that examinethe relation between explanation and unification. Halonen and Hintikka (1999), on the one hand,claim that no unification is explanation. Schurz (1999), on the other hand, claims that all explanationis unification. We give counterexamples to both claims.
Erik Weber, Maarten Van Dyck
openaire +1 more source
In this article we criticize two recent articles that examinethe relation between explanation and unification. Halonen and Hintikka (1999), on the one hand,claim that no unification is explanation. Schurz (1999), on the other hand, claims that all explanationis unification. We give counterexamples to both claims.
Erik Weber, Maarten Van Dyck
openaire +1 more source

