The semantically guided linear deduction system
SGLD has been implemented in Prolog, and performance testing shows the efficacy of using semantic information to guide search. As well the features described above, SGLD has facilities for imposing sort value deletion and for embedding equality. Sort value deletion is imposed via the same mechanism as the truth value deletion, but throughout deductions. Equality is embedded via an extension of the RUE and NRF inference rules [Digricoli, 1979].
Unable to display preview. Download preview PDF.
- Digricoli V.J., Automatic Deduction and Equality, In Martin A.L. (Ed.), Proceedings of the Annual Conference of the ACM (Detroit, MI, 1979) ACM Press, New York, NY, (1979), 240–250.Google Scholar
- Loveland D.W., A Simplified Format for the Model Elimination Theorem-Proving Procedure, In Journal of the ACM 16(3), ACM Press, New York, NY, (1969), 349–363.Google Scholar
- Shostak R.E., Refutation Graphs, In Artificial Intelligence 7, Elsevier Science, Amsterdam, The Netherlands, (1976), 51–64.Google Scholar
- Sutcliffe G., A General Clause Theorem Prover, In Stickel M.E. (Ed.), Proceedings of the 10th International Conference on Automated Deduction (Kaiserslautern, Germany, 1990), (Siekmann J.H. (Ed.), Lecture Notes in Artificial Intelligence 449), Springer-Verlag, New York, NY, (1990), 675–676.Google Scholar
- Sutcliffe G., Linear-Input Subset Analysis, In Kapur D. (Ed.), Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, NY, 1992) Springer-Verlag, New York, NY, (1992).Google Scholar