Rigid E-Unification: NP-Completeness and Applications to Equational Matings
暂无分享,去创建一个
[1] Nachum Dershowitz,et al. Orderings for Equational Proofs , 1986, LICS.
[2] Patrick Lincoln,et al. Linear logic , 1992, SIGA.
[3] N. A C H U M D E R S H O W I T Z. Termination of Rewriting' , 2022 .
[4] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[5] Mike Paterson,et al. Linear unification , 1976, STOC '76.
[6] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[7] Paliath Narendran,et al. Theorem proving using equational matings and rigid E-unification , 1992, JACM.
[8] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.
[9] Wayne Snyder,et al. Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.
[10] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[11] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[12] Greg Nelson,et al. Fast Decision Procedures Based on Congruence Closure , 1980, JACM.
[13] Azriel Levy. Basic set theory , 1979 .
[14] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.
[15] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.
[16] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .
[17] Paliath Narendran,et al. Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time , 1988, CADE.
[18] Yves Métivier. About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm , 1983, Inf. Process. Lett..
[19] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[20] Dexter Kozen. Communication: Positive First-Order Logic is NP-Complete , 1981, IBM J. Res. Dev..
[21] Peter B. Andrews. Theorem Proving via General Matings , 1981, JACM.
[22] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .
[23] Paliath Narendran,et al. Rigid E-unification is NP-complete , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[24] L. Bachmair. Canonical Equational Proofs , 1991, Progress in Theoretical Computer Science.