Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Intersection of Regular Languages and Star Hierarchy
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
A finite set of functions with an EXPTIME-complete composition problem
Theoretical Computer Science
OWL Datatypes: Design and Implementation
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A Rice-style theorem for parallel automata
Information and Computation
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The Causal Graph Revisited for Directed Model Checking
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
automata: a hybrid system for computational automata theory
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Complexity of some problems in universal algebra extended abstract
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Conjunctive queries for a tractable fragment of OWL 1.1
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Non-standard inferences in description logics
Non-standard inferences in description logics
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The complexity of codiagnosability for discrete event and timed systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Query answering under expressive entity-relationship schemata
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Recurrence and transience for finite probabilistic tables
Theoretical Computer Science
Reasoning about finite-state switched systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Abstractions and pattern databases: the quest for succinctness and accuracy
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Unification in the description logic EL without the top concept
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Decidability of unification in EL without top constructor
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Analysis of recursively parallel programs
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
Thread-modular verification is cartesian abstract interpretation
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Complexity of Data Dependence Problems for Program Schemas with Concurrency
ACM Transactions on Computational Logic (TOCL)
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On the equivalence problem for programs with mode switching
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Detecting fair non-termination in multithreaded programs
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Precise thread-modular verification
SAS'07 Proceedings of the 14th international conference on Static Analysis
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Synchronization of automata with one undefined or ambiguous transition
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Parameterized regular expressions and their languages
Theoretical Computer Science
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decision problems for additive regular functions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Conjunctive regular path queries in lightweight description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Querying Regular Graph Patterns
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Two decidable logical theories are presented, one complete for deterministic polynomial time, one complete for polynomial space. Both have natural proof systems. A lower space bound of n/log(n) is shown for the proof system for the PTIME complete theory and a lower length bound of 2cn/log(n) is shown for the proof system for the PSPACE complete theory.