The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity of Finitely Presented Algebras
Complexity of Finitely Presented Algebras
Finitely Presented Algebras and the Polynomial Time Hiercharchy
Finitely Presented Algebras and the Polynomial Time Hiercharchy
The circuit value problem is log space complete for P
ACM SIGACT News
Formal languages and their relation to automata
Formal languages and their relation to automata
ACM Computing Surveys (CSUR)
Equational theories and database constraints
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
On the relationship of congruence closureand unification
Journal of Symbolic Computation
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
Taxonomic syntax for first order inference
Journal of the ACM (JACM)
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
A theory of using history for equational systems with applications
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
Complexity of Linear Standard Theories
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Using Decision Procedures with a Higher-Order Logic
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
On the Complexity of Finite Sorted Algebras
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
Complexity of implementations on the level of algebraic specifications
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Pebblings, edgings, and equational logic
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Term rewriting restricted to ground terms
Theoretical Computer Science
Note: on ground tree transformations and congruences induced by tree automata
Theoretical Computer Science
A clique problem equivalent to graph isomorphism
ACM SIGACT News
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient E-Matching for SMT Solvers
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automated deduction for verification
ACM Computing Surveys (CSUR)
Strategies in rigid-variable methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Unique normal forms and confluence of rewrite systems: persistence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Positive first-order logic is NP-complete
IBM Journal of Research and Development
Complexity of some problems in universal algebra extended abstract
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
An algebra A is finitely presented if there is a finite set G of generator symbols, a finite set O of operator symbols, and a finite set &Ggr; of defining relations x&Xgr;y where x and y are well-formed terms over G and O, such that A is isomorphic to the free algebra on G and O modulo the congruence induced by &Ggr;. The uniform word problem, the finiteness problem, the triviality problem (whether A is the one element algebra), and the subalgebra membership problem (whether a given element of A is contained in a finitely generated subalgebra of A) for finitely presented algebras are shown to be ≤mlog-complete for P. The schema satisfiability problem and schema validity problem are shown to be ≤mlog-complete for NP and co-NP, respectively. Finally, the problem of isomorphism of finitely presented algebras is shown to be polynomial time many-one equivalent to the problem of graph isomorphism.