Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic
This paper presents a way in which symbolic computation can be used in automated theorem provers and specially in a system for automated sequent derivation in multi-valued logic. As an example of multi-valued logic, an extension of Post’s Logic with linear order is considered. The basic ideas and main algorithms used in this system are presented. One of the important parts of the derivation algorithm is a method designed to recognize axioms of a given logic. This algorithm uses a symbolic computation method for establishing the solvability of systems of linear inequalities of special type. It will be shown that the algorithm has polynomial cost.
Unable to display preview. Download preview PDF.
- A.S. Karpenko, Multivalued logics. Logic and Computer. Issue 4, Moscow, Nauka, 1997.Google Scholar
- Kossovski N.K., Tishkov A.V. Logical theory of Post Logic with linear order. TR-98-11, Department of Informatics University Paris-12. 9p.Google Scholar
- N. Kossovski, A. Tishkov. Gradable Logical Values For Knowledge Representation. Notes of Scientific Seminars vol. 241 pp 135–149 St.Petersburg University 1996.Google Scholar
- R. Tarjan, Data Structures and Network Algorithms, SIAM Philadelphia,(1983) 71–95Google Scholar
- Gerberding S. Deep Thought. University of Darmstadt, Dept. of Computer Science, 1996.Google Scholar
- Lowerence C. Paulson. Designing a theorem Prover. Oxford, 1995. pp. 416–476.Google Scholar
- Michael J. Panik. Linear Programming: Mathematics, Theory and Algorithms. Kluwer Academic Publishers, 1996. pp.125–139.Google Scholar
- L.G. Hachiyan, A polinomial algorithm in linear programming, Soviet Mathematics Doclady 20,(1979), pp. 191–194.Google Scholar
- Jorge Nocedal, Stephen J. Wright. Numerical Optimization, Springer, 1999.Google Scholar