Languages that capture complexity classes
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Finding reductions automatically
Fields of logic and computation
| Hi-index | 0.00 |
We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counter- examples of conjectures, reductions between problems, and visualizations of structures and queries. DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/~immerman/de . We encourage researchers and students at all levels to experiment with it. Please tell us of your insights, progress, suggestions, or extensions of DE.