#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1984

2000

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David A. Wolfram
- 1990

- Joseph A. Goguen, David A. Wolfram
- DS-4
- 1990

- David A. Wolfram, Joseph A. Goguen
- Object-Based Concurrent Computing
- 1991

Gray [14] identifies the origins of sheaf theory in algebraic topology in the works of Alexander [1] in 1938, and Leray [15] in 1945. Apart from algebraic topology, Gray also describes its grasp on complex analysis, algebraic geometry, differential equations, and category theory. Sheaves have more recently been used as models for concurrency. Perhaps the… (More)

- David A. Wolfram
- Theor. Comput. Sci.
- 1994

- David A. Wolfram
- Journal of Automated Reasoning
- 1986

Restrictions of the problem of finding all maximal unifiable or minimal nonunifiable subsets to those of certain sizes are shown to be NP-hard, and consequently inappropriate in general for reducing thrashing by intelligent backtracking in resolution theorem provers and logic program executions. We also show that existing backtrack methods based on the… (More)

- David A. Wolfram
- Artificial Intelligence in Medicine
- 1995

INTERNIST-I was an expert system designed in the early 1970's to diagnose multiple diseases in internal medicine by modelling the behaviour of clinicians. Its form and operation are described, and evaluations of the system are surveyed. The major result of the project was its knowledge base which has been used in successor systems for medical education and… (More)

- Qing Guo, Paliath Narendran, David A. Wolfram
- CADE
- 1996

We consider equational uniication and matching problems where the equational theory contains a nilpotent function, i.e., a function f satisfying f(x;x) = 0 where 0 is a constant. Nilpotent matching and uniication are shown to be NP-complete. In the presence of associativity and commutativity, the problems still remain NP-complete. But when 0 is also assumed… (More)

- David A. Wolfram
- Inf. Process. Lett.
- 1989

Forward checking (FC) [l] is similar to backtracking except that after a choice is made, the sets containing possible future choices are pushed on a stack and filtered [5] by deleting inconsistent choices from them. If ever a selected set is empty, the stack is popped to find a previously selected set which is not empty. FC has principally been used to… (More)

- Karsten Konrad, David A. Wolfram
- CADE
- 1999

Kimba is the rst model generation program which implements a semi-decision procedure for nite satissability of rst-order logics with nitely many truth values. The procedure enumerates the nite models of its input and can be used to compute eeciently domain minimal models whose positive part is minimal in size. Kimba has been implemented in the constraint… (More)