منابع مشابه
A Fully Syntactic AC-RPO
We present the first fully syntactic (i.e., non-interpretation-based) AC-compatible recursive path ordering (RPO). It is simple, and hence easy to implement, and its behaviour is intuitive as in the standard RPO. The ordering is AC-total and defined uniformly for both ground and nonground terms, as well as for partial precedences. More important, it is the first one that can deal incrementally ...
متن کاملA Total Ac-compatible Ordering with Rpo Scheme ?
Like Kapur and Sivakumar in KS97], we present an AC-compatible simpliication ordering total on ground terms that follows the same scheme as the recursive path ordering (RPO). The rst improvement with respect to their work is that our ordering has a simpler deenition, and as a consequence we can obtain simpler proofs for the properties of the ordering and get a better understanding of the diicul...
متن کاملA Total AC-Compatible Ordering Based on RPO
We deene a simpliication ordering on terms which is AC-compatible and total on non-AC-equivalent ground terms, without any restrictions on the signature like the number of AC-symbols or free symbols. Unlike previous work by Narendran and Rusinowitch NR91], our AC-RPO ordering is not based on polynomial interpretations, but on a simple extension of the well-known RPO ordering (with a total (arbi...
متن کامل"Syntactic" AC-Unification
The rules for unification in a simple syntactic theory, using Kirchner’s mutation [15, 16] do not terminate in the case of associativecommutative theories. We show that in the case of a linear equation, these rules terminate, yielding a complete set of solved forms, each variable introduced by the unifiers corresponding to a (trivial) minimal solution of the (trivial) Diophantine equation where...
متن کاملFully Lexicalized Head-Driven Syntactic Generation
We describe a new approach to syntactic generation with Head-Driven Phrase Structure Grammars (HPSG) that uses an extensive off-line preprocessing step. Direct generation algo• rithms apply the phra~se-structure rules (schemata) of the grammar on:line which is an computationally expensive step. Instead, we collect off-line for every lexical type of the HPSG grammar all minimally complete projec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2002.3158