Travelled to:1 × Germany
1 × Poland
1 × Spain
7 × USA
Collaborated with:W.F.Ogden ∅ G.Zhang J.Dörre M.D.Moshier R.T.Kasper S.D.Brookes W.E.Riddle M.Jazayeri
Talks about:complex (3) logic (3) tree (3) structur (2) grammar (2) context (2) free (2) behaviour (1) transduc (1) subsumpt (1)
Person: William C. Rounds
DBLP: Rounds:William_C=
Facilitated 1 volumes:
EdContributed to:
19971990
19871986
198319781975197219701969Wrote 10 papers:
- LICS-1997-ZhangR #complexity #reasoning
- Complexity of Power Default Reasoning (GQZ, WCR), pp. 328–339.
- LICS-1990-DorreR #algebra #on the
- On Subsumption and Semiunification in Feature Algebras (JD, WCR), pp. 300–310.
- POPL-1987-MoshierR #data type #logic
- A Logic for Partially Specified Data Structures (MDM, WCR), pp. 156–167.
- LICS-1986-RoundsK #calculus #logic #representation
- A Complete Logical Calculus for Record Structures Representing Linguistic Information (WCR, RTK), pp. 38–43.
- ICALP-1983-BrookesR #behaviour #equivalence #logic #programming
- Behavioural Equivalence Relations Induced by Programming Logics (SDB, WCR), pp. 97–108.
- POPL-1978-OgdenRR #complexity #concurrent
- Complexity of Expressions Allowing Concurrency (WFO, WER, WCR), pp. 185–194.
- POPL-1975-JazayeriOR #attribute grammar #complexity #on the
- On the Complexity of the Circularity Test for Attribute Grammars (MJ, WFO, WCR), pp. 119–129.
- STOC-1972-OgdenR #composition #transducer
- Compositions of n Tree Transducers (WFO, WCR), pp. 198–206.
- STOC-1970-Rounds #proving #theorem
- Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages (WCR), pp. 109–116.
- STOC-1969-Rounds #context-free grammar
- Context-Free Grammars on Trees (WCR), pp. 143–148.