Author： Heras Federico Larrosa Javier
Publisher： Springer Publishing Company
ISSN： 1381-1231
Source： Journal of Heuristics, Vol.12, Iss.4-5, 2006-09, pp. : 287-306
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Better-quasi-orderings and coinduction
By Forster T.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Access to resources
Recommend
Involutive divisions and monomial orderings
Programming and Computer Software, Vol. 33, Iss. 3, 2007-05 ,pp. :
Characterisations of balanced words via orderings
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
Fuzzy orderings in flexible query answering systems
Soft Computing, Vol. 8, Iss. 7, 2004-07 ,pp. :
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :