Record Beta

Formal Structures for Computation and Deduction (FSCD) / Rewriting Techniques and Applications (RTA)

https://id.confref.org/data/confref-portal/event/rta1991

This record is part of the confref event International Conference on Rewriting Techniques and Applications.

rdf:type	portal:Conference
schema:location	Como (wd:Q1308)
rdfs:label	Formal Structures for Computation and Deduction (FSCD) / Rewriting Techniques and Applications (RTA)
portal:acronym	RTA
portal:area	https://id.confref.org/data/confref-portal/area/2
portal:city	Como
portal:country	Italy
portal:endDate	1991-04-12
portal:keyword	(Deterministic) tree automaton with pushdown store
portal:keyword	(Recognizable, Context-free) tree languages
portal:keyword	68Q50
portal:keyword	Automated theorem proving
portal:keyword	Boolean algebra
portal:keyword	Böhm Trees
portal:keyword	Church-Rosser (=confluent) systems
portal:keyword	Convergent (=noetherian+confluent) systems
portal:keyword	F4.1
portal:keyword	F4.2
portal:keyword	Graph grammars
portal:keyword	Noetherian systems
portal:keyword	boundary and confluent graph grammars
portal:keyword	graph languages of bounded degree
portal:keyword	head normal forms
portal:keyword	infinitary rewriting
portal:keyword	infinite Church-Rosser Properties
portal:keyword	non-unifiable term rewriting systems
portal:keyword	normal forms
portal:keyword	operator normal form
portal:name	Formal Structures for Computation and Deduction (FSCD) / Rewriting Techniques and Applications (RTA)
portal:portalPage	http://portal.confref.org/list/rta1991
portal:series	https://id.confref.org/data/confref-portal/series/rta
portal:startDate	1991-04-10
portal:submissionExtended	false
portal:year	1991
cr:discipline	computer science (wd:Q21198)
cr:field	Computer and information sciences (https://id.confref.org/data/oecd-fos/1.2)
cr:sameAs	https://dblp.org/db/conf/rta/rta91

Data: Turtle · JSON-LD · N-Triples · RDF/XML

Beta confref labs is under development. Identifiers are stable; pages, data and services can change.