Abstract
The Logistica 2.0 Deduction System Implementation Technology is a programming language extension to R5RS Scheme which automatically computes all possible combinations of values of multiply valued subexpressions. Multiple values are generated by multiple definitions of a symbol and by allowing Second Order patterns such as segment variables, which may match in different ways, as the parameters of lambda abstractions. This technology is briefly illustrated with an extensible deduction system involving the derivation of an axiom schema.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Araya, C., Brown, F.M.: Schemata: A Language for Deduction. In: 9th. European Conference on Artificial Intelligence, Stockholm, Sweden (1990)
Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1981)
Boyer, R.S., Moore, J.S.: Metafunctions: proving them correct and using them efficiently as new proof procedures. In: Boyer, R.S., Moore, J.S. (eds.) The Correctness Problem in Computer Science. Academic Press, New York (1981)
Brown, F.M.: The Theory of Meaning, Department of Artificial Intelligence Research Report 35, University of Edinburgh, June 1977, University of Edinburgh, Edinburgh Artificial Intelligence Research Papers 1973-1986, Scientific Datalink microfische (1989)
Brown, F.M.: Towards the Automation of Set Theory and its Logic. Artificial Intelligence 10 (1978)
Brown, F.M.: An investigation into the goals of research in Automatic Theorem Proving as related to Mathematical Reasoning. Artificial Intelligence (1980)
Brown, F.M.: An Experimental Logic based on the Fundamental Deduction Principal. Artificial Intelligence 30(2), 117–263 (1986)
Brown, F.M.: Prologue to a Theory of Design Change and its Automation. In: Proceedings Mid-America Conference on Intelligent Systems (1994)
Brown, F.M., Leasure, D.: Proving Schematic Metatheorems by Induction. In: Procedings of the Fourth Midwest Artificial Intelligence and Cognitive Science Society Conference (1992)
Brown, F.M., Leasure, D.E., Peterson, N.: Logistica: A High-Level Programming language for Implementing Design Verification Systems. In: AAAI workshop on Systems Engineering (June 1993)
Brown, F.M., Liu, P.: A Logic Programming and Verification System for Recursive Quantificational Logic. In: International Joint Conference on Artificial Intelligence, vol. 85 (August 1985)
Church, A.: The Calculi of Lambda-Conversion. In: Annals of Mathematical Studies, vol. 6. Princeton University Press, Princeton (1941)
Hayes, P.J.: Computation as Deduction. In: Proceedings 2nd MFCS Symposium, Czechoslovakia Academy of Sciences, Prague, Czechoslovakia (1973)
Kelsey, K., et al.: Revised5 Report on the Algorithmic Language Scheme. February 20 (1988), http://download.plt-scheme.org/doc/203/html/r5rs/index.htm
Kowalski, R.: Predicate Logic as Programming Language. In: Proceedings of IFIP74. North-Holland, Amsterdam (1974)
Kowalski, R.: Algorithm = Logic + Control. In: CACM (August 1979)
McCarthy, J., et al.: LISP1.5 Programmers’ Manual. MIT Press, Cambridge (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, F.M. (2003). Logistica 2.0: A Technology for Implementing Automatic Deduction Systems. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive