Abstract
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].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
Shostak R.E., Refutation Graphs, In Artificial Intelligence 7, Elsevier Science, Amsterdam, The Netherlands, (1976), 51–64.
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.
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sutcliffe, G. (1992). The semantically guided linear deduction system. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_202
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_202
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive