T-Theorem proving I

Journal of Symbolic Computation

Volumn 20, Issue 3, 1995, Pages 315-342

  Policriti, Alberto ^a   Schwartz, Jacob T ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012623393     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1995.1053     Document Type: Article

References (20)

1. Baumgartner, P. (1992). A Model Elimination Calculus with Built-in Theories. In (H. J. Ohlbach, ed.) Proceedings of the ltfth German Conference on Artificial Intelligence. Springer-Verlag LNAI, 671.
2. Baumgartner, P. (1992). An Ordered Theory Resolution Calculus. In Proceedings of the Conference on Logic Programming and Artificial Intelligence. Springer-Verlag LNAI, 624.
3. Bibel, W. (1987). Automated Theorem Proving. Vieweg. Second Edition.
4. Burckert, H. J. (1986). Some Relationship Between Unification, Restricted Unification, and Matching. In Proceedings of 8th International Conference on Automated Deduction. Springer-Verlag LNCS, 230.
5. Burckert, H. J. (1991). A Resolution Principle for a Logic with Restricted Quantifiers. Springer-Verlag LNAI, 568.
6. Cantone, D., Ferro, A-, Omodeo, E. G. (1989). Computable Set Theory. Vol. 1. Oxford University Press, Int. Series of Monographs on Computer Science.
7. Chang, C., Lee, R. (1973). Symbolic Logic and Mechanical Theorem Proving. Academic Press.
8. Dreben, B., Goldfarb, W. D. (1979). The Decision Problem. Solvable classes of quantificational formulas. Addison-Wesley.
9. Ferro, A., Omodeo, E. G., Schwartz, J. T. (1980). Decision Procedures for Elementary Sublanguages of Set Theory I. Multilevel Syllogistic and Some Extensions. Communications on Pure and Applied Mathematics, 33, 599-608.
10. Formisano, A., Policriti, A. (1995). Refinements of T-resolution. Research report, University di Udine.
11. Frisch, A. M. (1991) The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence, 49, 161-198.
12. Loveland, D. W. (1978). Automated Theorem Proving. Amsterdam: North-Holland.
13. Nelson, G-, Oppen, D- C. (1979). Simplification by cooperating decision procedures. ACM Transaction on Programming Languages and Systems, 1 (2), 245-257.
14. Omodeo, E. G., Parlamento, F., Policriti, A. (1990). Truth tables for a combinatorial kernel of set theories. In Proceedings of ECAI’90.
15. Omodeo, E. G., Parlamento, F., Policriti, A. (1996). Decidability of 3V-sentences in Membership Theories. Mathematical Logic Quaterly, 42 (1). To appear.
16. Petermann, U. (1992). How to Build in an Open Theory into Connection Calculi. Journal on Computers and Artificial Intelligence, 11 (2), 105-142.
17. Petermann, J. (1993). Completeness of the pool calculus with an open built-in theory. In (G. Gottlob, A. Leitsch, A. Mundici, eds.) Computational Logic and Proof Theory. Proceedings of the 3rd K. Godel Colloquium. Springer-Verlag LNCS, 713.
18. Schmidt-Schaub, M. (1989). Computational Aspects of an Order-Sorted Logic with Term Declarations. Springer-Verlag LNAI, 395.
19. Stickel, M. E. (1983). Theory resolution: building in nonequational theories. In Proceedings of the AAAI-83, 391-397.
20. Stickel, M. E. (1985). Automated deduction by theory resolution. Journal of Automated Reasoning, 1 (4), 333-355.