The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An Efficient Unification Algorithm
Open accessAbstract
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given.A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nondeterministic one, and a PASCAL implementation is given.A comparison with other well-known unification algorithms shows that the algorithm described here performs well in all cases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Computer-Based Medical Consultations: MYCIN.
(1976) · Annals of Internal Medicine · doi:10.7326/0003-4819-85-6-831_1 · Cited by 2,502
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Symbolic Logic and Mechanical Theorem Proving
(1973) · Elsevier eBooks · doi:10.1016/c2009-0-22103-9 · Cited by 1,468
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Computational Problems in Abstract Algebra
(1970) · Elsevier eBooks · doi:10.1016/c2013-0-02156-1 · Cited by 634
A unification algorithm for typed λ-calculus
Huet, G. P. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90011-0 · Cited by 510
Hewitt, C. E. (1972) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 314
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Principles of Constraint Programming
Apt, K. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511615320 · Cited by 888
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
First-Order Theorem Proving and Vampire
Kovács, L., & Voronkov, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39799-8_1 · Cited by 485
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
Degano, P. (1983) · Pictorial Data Analysis · doi:10.1007/978-3-642-82017-5_12 · Cited by 265
Rewriting Logic as a Logical and Semantic Framework
Martí-Oliet, N., & Meseguer, J. (2002) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0464-9_1 · Cited by 253
Metadata
- Authors
- Martelli, A., & Montanari, U.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1982-04
- Volume
- 4
- Issue
- 2
- Pages
- 258-282
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2113722134
- Cited by
- 776
- References
- 18
- FWCI
- 17.10
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.