Treffer: On the complexity of recursive path orderings
Title:
On the complexity of recursive path orderings
Authors:
Source:
Information processing letters. 46(5):257-262
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Complexité calcul, Computing complexity, Complejidad cálculo, Démonstration automatique, Automatic proving, Demostración automática, Démonstration théorème, Theorem proving, Demostración teorema, Programmation logique, Logical programming, Programación lógica, Réécriture, Rewriting, Reescritura, Démonstration automatique théorème, Ordre terme, Term ordering, Réécriture terme, Term rewriting, Théorie programmation, Programming theory
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Boston univ., dep. computer sci., Boston MA 02215, United States
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4910777
Database:
PASCAL Archive