Substitution expressions: Extracting solutions of non-Horn clause proofs
In this paper a parallel proof procedure for non-Horn clauses based on Kowalski's connection graph proof procedure and the L-machine is described. For expressing non deterministic solutions, the new concept of substitution expressions is introduced. Substitution expressions are used in the parallel proof procedure and it is demonstrated by examples, how to extract a solution from a proof for non-Horn clauses using substitution expressions. Finally, a set of simplification rules for substitution expressions is given.
KeywordsGeneralize Substitution Horn Clause Simple Substitution Proof Procedure Actual Graph
Unable to display preview. Download preview PDF.
- Bibel W., Aspetsberger K., 1985. A Bibliography on Parallel Inference Machines. To appear in Journal of Symbolic Computation, Vol.1, Academic Press, London, 1985.Google Scholar
- Bibel W., Buchberger B., 1984. Towards a Connection Machine for Logical Inference. Int. Symp. on Fifth Generation and Super Computers, Rotterdam, Dec. 11–13, 1984. To appear in Future Generations Computer Systems, North Holland Publishing Comp.Google Scholar
- Buchberger B., 1983. Components for Restructurable Multi-Microprocessor Systems. Proceedings of the MIMI 83 Conference, Lugano, June 21–24, 1983, Acta Press, Zürich, pp. 67–71.Google Scholar
- Buchberger B., 1984. The Present State of the L-Networks Project. Proceedings of the MIMI 84 Conference, Bari, June 5–8, 1984, Acta Press, Zürich, pp. 178–181.Google Scholar
- Eder E., 1983. Properties of Substitutions and Unifications. 7th German Workshop on Artificial Intelligence, Dassel/Solling, September 1983. In Informatik-Fachberichte Nr. 76, Springer Verlag.Google Scholar
- Kowalski R., 1979. Logic for Problem Solving. (Artificial Intelligence Series), North Holland Publishing Company, New York, Oxford, 1979.Google Scholar
- Nilsson N.J., 1980. Principles of Aritficial Intelligence, Tioga, Palo Alto, 1980.Google Scholar
- Tyson M., Bledsoe W.W., 1979. Conflicting Bindings and Generalized Substitutions. Proceedings Forth Workshop on Automated Deduction (CADE-4), Austin, Texas, 1–3 February 1979.Google Scholar