Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

JSC
2008

favoriteEmaildiscussreport

72views more JSC 2008»

Flat matching

13 years 4 months ago

Download www.theorema.org

Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unification procedure to enumerate minimal complete set of unifiers is described. The flat matching procedure is compared with the flat matching algorithm implemented in the Mathematica system.

Temur Kutsia

Real-time Traffic

Flat Matching Procedure | Flexible Arity Symbols | JSC 2008 | Unification Procedure |

claim paper

Related Content

» NET A System for Extracting Web Data from Flat and Nested Data Records

» Reconstruction of isometrically deformable flat surfaces in 3D from multiple camera images

» Efficient 2D Grayscale Morphological Transformations With Arbitrary Flat Structuring Eleme...

» Scalable FlatCombining Based Synchronous Queues

» Revisiting Route Caching The World Should Be Flat

» AnswerFinder at TREC 2004

» Recognition of Planar Objects in 3D Space

» XML Prefiltering as a String Matching Problem

» GE adjunct test report objectoriented design and scoring for MUC4

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JSC
Authors	Temur Kutsia

Comments (0)