| 2000 |
|---|
| 16 | EE | David A. Wolfram:
Preface.
Electr. Notes Theor. Comput. Sci. 31: (2000) |
| 15 | | Qing Guo,
Paliath Narendran,
David A. Wolfram:
Complexity of Nilpotent Unification and Matching Problems.
Inf. Comput. 162(1-2): 3-23 (2000) |
| 14 | | David A. Wolfram:
A Formula for the General Solution of a Constant-coefficient Difference Equation.
J. Symb. Comput. 29(1): 79-82 (2000) |
| 1999 |
|---|
| 13 | EE | Karsten Konrad,
David A. Wolfram:
System Description: Kimba, A Model Generator for Many-Valued First-Order Logics.
CADE 1999: 282-286 |
| 1996 |
|---|
| 12 | | Qing Guo,
Paliath Narendran,
David A. Wolfram:
Unification and Matching Modulo Nilpotence.
CADE 1996: 261-274 |
| 1995 |
|---|
| 11 | | David A. Wolfram:
An appraisal of INTERNIST-I.
Artificial Intelligence in Medicine 7(2): 93-116 (1995) |
| 1994 |
|---|
| 10 | | David A. Wolfram:
A Semantics for lambda-Prolog.
Theor. Comput. Sci. 136(1): 277-289 (1994) |
| 1993 |
|---|
| 9 | | David A. Wolfram:
Semantics for Abstract Clauses.
TYPES 1993: 366-383 |
| 1991 |
|---|
| 8 | | David A. Wolfram,
Joseph A. Goguen:
A Sheaf Semantics for FOOPS Expressions.
Object-Based Concurrent Computing 1991: 81-98 |
| 7 | | David A. Wolfram:
Rewriting, and Equational Unification: the Higher-Order Cases.
RTA 1991: 25-36 |
| 1990 |
|---|
| 6 | | David A. Wolfram:
ACE: The Abstract Clause Engine.
CADE 1990: 679-680 |
| 5 | | Joseph A. Goguen,
David A. Wolfram:
On Types and FOOPS.
DS-4 1990: 1-22 |
| 1989 |
|---|
| 4 | | David A. Wolfram:
Forward Checking and Intelligent Backtracking.
Inf. Process. Lett. 32(2): 85-87 (1989) |
| 3 | | David A. Wolfram:
Intractable Unifiability Problems and Backtracking.
J. Autom. Reasoning 5(1): 37-47 (1989) |
| 1986 |
|---|
| 2 | | David A. Wolfram:
Intractable Unifiability Problems and Backtracking.
ICLP 1986: 107-121 |
| 1984 |
|---|
| 1 | | David A. Wolfram,
Michael J. Maher,
Jean-Louis Lassez:
A Unified Treatment of Resolution Strategies for Logic Programs.
ICLP 1984: 263-276 |
