# William C. Rounds

According to our database

^{1}, William C. Rounds## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2006

SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.

Electr. Notes Theor. Comput. Sci., 2006

2004

Reasoning with power defaults.

Theor. Comput. Sci., 2004

A Spatial Logic for the Hybrid p-Calculus.

Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

2003

The Phi-Calculus: 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.

Electr. Notes Theor. Comput. Sci., 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 (HICSS-30), 1997

1995

Domain Theory Meets Default Logic.

J. Log. Comput., 1995

1993

Constraints in Nonmonotonic Reasoning.

PPCP, 1993

A Logical Semantics for Nonmonotonic Sorts.

Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, 1993

1992

On Subsumption and Semiunifaction in Feature Algebras.

J. Symb. Comput., 1992

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.

Computational Linguistics, 1988

1987

Simultaneous-Distributive Coordination and Context-Freeness.

Computational 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 Context-Free 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

Information and 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

Information and 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 Exponential-Time Languages

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1973

Complexity of Recognition in Intermediate-Level 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.

Mathematical Systems Theory, 1970

Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages

Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1969

Context-Free Grammars on Trees

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969