default search action
William C. Rounds
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [c27]Hosung Song, Kevin J. Compton, William C. Rounds:
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN. AVoCS 2005: 167-183 - 2004
- [j13]Guo-Qiang Zhang
, William C. Rounds:
Reasoning with power defaults. Theor. Comput. Sci. 323(1-3): 321-350 (2004) - [c26]William C. Rounds:
A Spatial Logic for the Hybrid p-Calculus. HSCC 2004: 508-522 - 2003
- [c25]William C. Rounds, Hosung Song:
The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems. HSCC 2003: 435-449 - 2001
- [j12]William C. Rounds, Guo-Qiang Zhang
Clausal Logic and Logic Programming in Algebraic Domains. Inf. Comput. 171(2): 183-200 (2001)
1990 – 1999
- 1998
- [c24]Eric Klavins, William C. Rounds, Guo-Qiang Zhang:
Experimenting with Power Default Reasoning. AAAI/IAAI 1998: 846-852 - 1997
- [j11]William C. Rounds, Guo-Qiang Zhang:
Logical Considerations on Default Semantics. Ann. Math. Artif. Intell. 20(1-4): 195-226 (1997) - [j10]Guo-Qiang Zhang, William C. Rounds:
Nonmonotonic Consequences in Default Domain Theory. Ann. Math. Artif. Intell. 20(1-4): 227-265 (1997) - [j9]Guo-Qiang Zhang, William C. Rounds:
Defaults in Domain Theory. Theor. Comput. Sci. 177(1): 155-182 (1997) - [c23]Guo-Qiang Zhang
A Modal Logic for Reasoning about Belief. HICSS (5) 1997: 383- - [c22]Guo-Qiang Zhang, William C. Rounds:
Complexity of Power Default Reasoning. LICS 1997: 328-339 - [c21]Guo-Qiang Zhang, William C. Rounds:
Power Defaults. LPNMR 1997: 152-169 - [c20]Guo-Qiang Zhang
Resolution in the Smyth powerdomain. MFPS 1997: 409 - [p1]William C. Rounds:
Feature Logics. Handbook of Logic and Language 1997: 475-533 - 1995
- [j8]William C. Rounds, Guo-Qiang Zhang
Domain Theory Meets Default Logic. J. Log. Comput. 5(1): 1-25 (1995) - 1993
- [c19]Mark A. Young, William C. Rounds:
A Logical Semantics for Nonmonotonic Sorts. ACL 1993: 209-215 - [c18]William C. Rounds, Guo-Qiang Zhang:
Constraints in Nonmonotonic Reasoning. PPCP 1993: 247-257 - 1992
- [j7]Jochen Dörre, William C. Rounds:
On Subsumption and Semiunifaction in Feature Algebras. J. Symb. Comput. 13(4): 441-461 (1992) - 1990
- [c17]Jochen Dörre, William C. Rounds:
On Subsumption and Semiunification in Feature Algebras. LICS 1990: 300-310
1980 – 1989
- 1989
- [i1]Jochen Dörre, William C. Rounds:
On Subsumption and Semiunifaction in Feature Algebras. IWBS Report 97 (1989) - 1988
- [j6]William C. Rounds:
LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity. Comput. Linguistics 14(3): 1-9 (1988) - 1987
- [j5]Michael B. Kac, Alexis Manaster-Ramer, William C. Rounds:
Simultaneous-Distributive Coordination and Context-Freeness. Comput. Linguistics 13(1-2): 25-30 (1987) - [c16]William C. Rounds, Alexis Manaster-Ramer:
A Logical Version of Functional Grammar. ACL 1987: 89-96 - [c15]M. Drew Moshier, William C. Rounds:
On the Succinctness Properties of Unordered Context-Free Grammars. ACL 1987: 112-116 - [c14]M. Drew Moshier, William C. Rounds:
A Logic for Partially Specified Data Structures. POPL 1987: 156-167 - 1986
- [c13]William C. Rounds, Robert T. Kasper:
A Complete Logical Calculus for Record Structures Representing Linguistic Information. LICS 1986: 38-43 - 1985
- [j4]William C. Rounds:
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces. Inf. Control. 66(1/2): 6-28 (1985) - 1984
- [c12]William C. Rounds:
Applications of Topology to Semantics of Communicating Processes. Seminar on Concurrency 1984: 360-372 - 1983
- [j3]William G. Golson, William C. Rounds:
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees. Inf. Control. 57(2/3): 102-124 (1983) - [c11]Stephen D. Brookes, William C. Rounds:
Behavioural Equivalence Relations Induced by Programming Logics. ICALP 1983: 97-108 - 1981
- [c10]William C. Rounds, Stephen D. Brookes:
Possible Futures, Acceptances, Refusals, and Communicating Processes. FOCS 1981: 140-149
1970 – 1979
- 1979
- [c9]John S. Gourlay, William C. Rounds, Richard Statman:
On Properties Preserved by Contraction of Concurrent Systems. Semantics of Concurrent Computation 1979: 51-65 - 1978
- [c8]William F. Ogden, William E. Riddle, William C. Rounds:
Complexity of Expressions Allowing Concurrency. POPL 1978: 185-194 - 1975
- [j2]Mehdi Jazayeri, William F. Ogden, William C. Rounds:
The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. Commun. ACM 18(12): 697-706 (1975) - [c7]William C. Rounds:
A Grammatical Characterization of Exponential-Time Languages. FOCS 1975: 135-143 - [c6]Mehdi Jazayeri, William F. Ogden, William C. Rounds:
On the Complexity of the Circularity Test for Attribute Grammars. POPL 1975: 119-129 - [c5]Kenneth G. Walter, Samuel I. Schaen, William F. Ogden, William C. Rounds, D. G. Shumway, D. D. Schaeffer, K. J. Biba, Franklyn T. Bradshaw, S. R. Ames, J. M. Gilligan:
Structured specification of a Security Kernel. Reliable Software 1975: 285-293 - [e1]William C. Rounds, Nancy Martin, Jack W. Carlyle, Michael A. Harrison:
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, May 5-7, 1975, Albuquerque, New Mexico, USA. ACM 1975 [contents] - 1973
- [c4]William C. Rounds:
Complexity of Recognition in Intermediate-Level Languages. SWAT 1973: 145-158 - 1972
- [c3]William F. Ogden, William C. Rounds:
Compositions of n Tree Transducers. STOC 1972: 198-206 - 1970
- [j1]William C. Rounds:
Mappings and Grammars on Trees. Math. Syst. Theory 4(3): 257-287 (1970) - [c2]William C. Rounds:
Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages. STOC 1970: 109-116
1960 – 1969
- 1969
- [c1]William C. Rounds:
Context-Free Grammars on Trees. STOC 1969: 143-148
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: