论文信息 - Reasoning About Recursively Defined Data Structures

Reasoning About Recursively Defined Data Structures

A decision algorithm is given for the quantifier-free theory of recursively defined data structures which, for a conjunction of length n, decides its satisfiability in time linear in n. The first-order theory of recursively defined data structures, in particular the first-order theory of LISP list structure (the theory of CONS, CAR and CDR), is shown to be decidable but not elementary recursive.

Derek C. Oppen

[1] Greg Nelson,et al. Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[2] Robert S. Boyer,et al. A Lemma Driven Automatic Theorem Prover for Recursive Function Theory , 1977, IJCAI.

[3] C. Rackoff,et al. THE COMPUTATIONAL COMPLEXITY OF SOME LOGICAL THEORIES , 1975 .

[4] Mike Paterson,et al. Linear unification , 1976, STOC '76.

[5] Ellis Horowitz,et al. Abstract data types and software validation , 1978, CACM.

[6] Benjamin Franklin Wells,et al. Review: A. I. Mal'cev, On the Elementary Theories of Locally Free Universal Algebras; A. I. Mal'cev, Axiomatizable Classes of Locally Free Algebras of Several Types , 1967 .

[7] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.

[8] Greg Nelson,et al. Simplification by Cooperating Decision Procedures , 1979, TOPL.

[9] Richard Lee Tenney,et al. Decidable Pairing Functions , 1972 .

[10] Derek C. Oppen,et al. Complexity, Convexity and Combinations of Theories , 1980, Theor. Comput. Sci..