A practically efficient and almost linear unification algorithm

Artificial Intelligence 36 (2):249-263 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,391

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Unification in linear temporal logic LTL.Sergey Babenyshev & Vladimir Rybakov - 2011 - Annals of Pure and Applied Logic 162 (12):991-1000.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
A decision algorithm for linear sentences on a PFM.Lian Li, Huilin Li & Yixun Liu - 1993 - Annals of Pure and Applied Logic 59 (3):273-286.
A unification algorithm for second-order monadic terms.William M. Farmer - 1988 - Annals of Pure and Applied Logic 39 (2):131-174.
Linear Processing with Pregroups.Anne Preller - 2007 - Studia Logica 87 (2-3):171-197.
Clausal Proofs and Discontinuity.Glyn Morrill - 1995 - Logic Journal of the IGPL 3 (2-3):403-427.
Efficiency of pregroups and the French noun phrase.Sylvain Degeilh & Anne Preller - 2005 - Journal of Logic, Language and Information 14 (4):423-444.
Safe Bounds in Semidefinite Programming by Using Interval Arithmetic.Orkia Derkaoui - 2014 - American Journal of Operations Research 4:293-300.
Applying Allen's constraint propagation algorithm for non-linear time.El?Bieta Hajnicz - 1996 - Journal of Logic, Language and Information 5 (2):157-175.

Analytics

Added to PP
2020-12-22

Downloads
1 (#1,500,695)

6 months
1 (#451,971)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references