[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/cl/NarendranR00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Micha%E2%88%9A%C4%99l_Rusinowitch>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Paliath_Narendran>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-44957-4%5F44>
foaf:homepage <https://doi.org/10.1007/3-540-44957-4_44>
dc:identifier DBLP conf/cl/NarendranR00 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-44957-4%5F44 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label The Theory of Total Unary RPO Is Decidable. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Micha%E2%88%9A%C4%99l_Rusinowitch>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Paliath_Narendran>
swrc:pages 660-672 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/cl/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/cl/NarendranR00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/cl/NarendranR00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/cl/cl2000.html#NarendranR00>
rdfs:seeAlso <https://doi.org/10.1007/3-540-44957-4_44>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/cl>
dc:subject recursive path ordering, first-order theory, ground reducibility, tree automata, ordered rewriting. (xsd:string)
dc:title The Theory of Total Unary RPO Is Decidable. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document