A Unified Treatment of Resolution Strategies for Logic Programs. - David A. Wolfram; Michael J. Maher; Jean-Louis Lassez (ICLP, 1984)

Forward Checking and Intelligent Backtracking. - David A. Wolfram (Inf. Process. Lett., 1989)

Intractable Unifiability Problems and Backtracking. - David A. Wolfram (J. Autom. Reason., 1989)

ACE: The Abstract Clause Engine. - David A. Wolfram (CADE, 1990)

On Types and FOOPS. - Joseph A. Goguen; David A. Wolfram (DS-4, 1990)

The Clausal Theory of Types. - David A. Wolfram (1990)

A Sheaf Semantics for FOOPS Expressions. - David A. Wolfram; Joseph A. Goguen (Object-Based Concurrent Computing, 1991)

Rewriting, and Equational Unification: the Higher-Order Cases. - David A. Wolfram (RTA, 1991)

Semantics for Abstract Clauses. - David A. Wolfram (TYPES, 1993)

A Semantics for lambda-Prolog. - David A. Wolfram (Theor. Comput. Sci., 1994)

An appraisal of INTERNIST-I. - David A. Wolfram (Artif. Intell. Medicine, 1995)

Unification and Matching Modulo Nilpotence. - Qing Guo; Paliath Narendran; David A. Wolfram (CADE, 1996)

System Description: Kimba, A Model Generator for Many-Valued First-Order Logics. - Karsten Konrad; David A. Wolfram (CADE, 1999)

Complexity of Nilpotent Unification and Matching Problems. - Qing Guo; Paliath Narendran; David A. Wolfram (Inf. Comput., 2000)

A Formula for the General Solution of a Constant-coefficient Difference Equation. - David A. Wolfram (J. Symb. Comput., 2000)

Preface. - David A. Wolfram (CATS, 2000)

Factoring Variants of Chebyshev Polynomials of the First and Second Kinds with Minimal Polynomials of cos(2π/d). - David A. Wolfram (Am. Math. Mon., 2022)