William C. Rounds
According to our database^{1},
William C. Rounds
authored at least 40 papers
between 1969 and 2006.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at andrej.com
On csauthors.net:
Bibliography
2006
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.
Electron. Notes Theor. Comput. Sci., 2006
2004
Reasoning with power defaults.
Theor. Comput. Sci., 2004
A Spatial Logic for the Hybrid pCalculus.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004
2003
The PhiCalculus: A Language for Distributed Control of Reconfigurable Embedded Systems.
Proceedings of the Hybrid Systems: Computation and Control, 2003
2001
Clausal Logic and Logic Programming in Algebraic Domains.
Inf. Comput., 2001
1998
Experimenting with Power Default Reasoning.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998
1997
Defaults in Domain Theory.
Theor. Comput. Sci., 1997
Resolution in the Smyth powerdomain.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997
Nonmonotonic Consequences in Default Domain Theory.
Ann. Math. Artif. Intell., 1997
Logical Considerations on Default Semantics.
Ann. Math. Artif. Intell., 1997
Power Defaults.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997
Complexity of Power Default Reasoning.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997
A Modal Logic for Reasoning about Belief.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS30), 1997
Feature Logics.
Proceedings of the Handbook of Logic and Language., 1997
1995
Domain Theory Meets Default Logic.
J. Log. Comput., 1995
1993
Constraints in Nonmonotonic Reasoning.
Proceedings of the Principles and Practice of Constraint Programming, 1993
A Logical Semantics for Nonmonotonic Sorts.
Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, 1993
1990
On Subsumption and Semiunification in Feature Algebras
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990
1989
On Subsumption and Semiunifaction in Feature Algebras
IWBS Report, 1989
1988
LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity.
Comput. Linguistics, 1988
1987
SimultaneousDistributive Coordination and ContextFreeness.
Comput. Linguistics, 1987
A Logic for Partially Specified Data Structures.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987
A Logical Version of Functional Grammar.
Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, 1987
On the Succinctness Properties of Unordered ContextFree Grammars.
Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, 1987
1986
A Complete Logical Calculus for Record Structures Representing Linguistic Information
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986
1985
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces
Inf. Control., 1985
1984
Applications of Topology to Semantics of Communicating Processes.
Proceedings of the Seminar on Concurrency, 1984
1983
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees
Inf. Control., 1983
Behavioural Equivalence Relations Induced by Programming Logics.
Proceedings of the Automata, 1983
1981
Possible Futures, Acceptances, Refusals, and Communicating Processes
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1979
On Properties Preserved by Contraction of Concurrent Systems.
Proceedings of the Semantics of Concurrent Computation, 1979
1978
Complexity of Expressions Allowing Concurrency.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978
1975
The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
Commun. ACM, 1975
On the Complexity of the Circularity Test for Attribute Grammars.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975
A Grammatical Characterization of ExponentialTime Languages
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1973
Complexity of Recognition in IntermediateLevel Languages
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973
1972
Compositions of n Tree Transducers
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972
1970
Mappings and Grammars on Trees.
Math. Syst. Theory, 1970
TreeOriented Proofs of Some Theorems on ContextFree and Indexed Languages
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970
1969
ContextFree Grammars on Trees
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969