Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Automated complexity analysis based on ordered resolutionJournal of the ACM, 2001
- Abstract Congruence Closure and SpecializationsPublished by Springer Nature ,2000
- Polynomial Time Uniform Word ProblemsMathematical Logic Quarterly, 1995
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993
- Finitely presented lattices: canonical forms and the covering relationTransactions of the American Mathematical Society, 1989
- The word and generator problems for latticesInformation and Computation, 1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Identity and existence in intuitionistic logicPublished by Springer Nature ,1979