Deduction and abduction using a sequent calculus
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)
A sequent calculus for automated reasoning is a particular sequent calculus that constitutes a single uniform method to perform different types of logical inferences in first order theories.
KeywordsTransformation Rule Proof System Hilbert Schema Predicate Symbol Sequent Calculus
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Aiello, L., Colagrossi, A., Micarelli, A., Miola, A. (1992): Building the expert module for ITS in mathematics: a general reasoning apparatus. In: Nwana, H. S. (ed.): Mathematical intelligent learning environments. Intellectic Publishing, Oxford, pp. 35–51.Google Scholar
- Bonamico, S., Cioni, G. (1988): Embedding flexible control strategies into object oriented languages. In: Mora, T. (ed.): Applied algebra, algebraic algorithms and errorcorrecting codes. Springer, Berlin Heidelberg New York Tokyo, pp. 454–457 (Lecture notes in computer science, vol. 357).Google Scholar
- Bonamico, S., Cioni, G., Colagrossi, A. (1990): A gentzen based deduction method for mathematical problems solving. In: Balagurusamy, E., Sushila, B. (eds.): Computer systems and applications: recent trends. Tata McGraw-Hill, New Delhi, pp. 102–113.Google Scholar
- Miola, A. (1991): Symbolic computation and artificial intelligence. In: Jorrand, P., Kelemen, J. (eds.): Fundamentals of Artificial Intelligence Research, FAIR’91. Springer, Berlin Heidelberg New York Tokyo, pp. 244–255 (Lecture notes in computer science, vol. 535).Google Scholar
- Miola, A. (ed.) (1995): Design and implementation of symbolic computation systems. J. Symb. Comput. 19.Google Scholar
© Springer-Verlag Wien 1997