The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Efficient Unification Algorithm. https://app.cochat.ai/papers/10.1145/357162.357169
- The paper
- Martelli, A., & Montanari, U. (1982). An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/357162.357169
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.
