Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
暂无分享,去创建一个
[1] Andrei Voronkov,et al. A New Procedural Interpretation of Horn Clauses with Equality , 1995, ICLP.
[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[3] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[4] Tanel Tammet,et al. A Resolution Theorem Prover for Intuitonistic Logic , 1996, CADE.
[5] Andrei Voronkov,et al. Simultaneous Regid E-Unification Is Undecidable , 1995, CSL.
[6] J. Girard. Proof Theory and Logical Complexity , 1989 .
[7] Wayne Snyder,et al. Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.
[8] V. A. Lifshits. PROBLEM OF DECIDABILITY FOR SOME CONSTRUCTIVE THEORIES OF EQUALITIES , 1969 .
[9] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[10] S. Yu Maslov. An Inverse Method for Establishing Deducibility of Nonprenex Formulas of the Predicate Calculus , 1967 .
[11] Andrei Voronkov. Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction , 1996, TABLEAUX.
[12] Andrei Voronkov,et al. Decidability problems for the prenex fragment of intuitionistic logic , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[13] Andrei Voronkov,et al. The Undecidability of Simultaneous Rigid E-Unification , 1996, Theor. Comput. Sci..
[14] David A. Plaisted,et al. Special Cases and Substitutes for Rigid E-Unification , 2000, Applicable Algebra in Engineering, Communication and Computing.
[15] Andrei Voronkov,et al. Equality Elimination for the Inverse Method and Extension Procedures , 1995, IJCAI.
[16] Vladimir Yu. Sazonov,et al. A Logical Approach to the Problem "P=NP?" , 1980, MFCS.
[17] Margus Veanes,et al. Some undecidable problems related to the Herbrand theorem , 1997 .
[18] S. Yu. Maslov,et al. Invertible Sequential Variant of Constructive Predicate Calculus , 1969 .
[19] Natarajan Shankar,et al. Proof search in first-order linear logic and other cut-free sequent calculi , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[20] Andrei Voronkov,et al. General Connections via Equality Elimination , 1995, WOCFAI.
[21] G. E. Mints. Choice of Terms in Quantifier Rules of Constructive Predicate Calculus , 1969 .
[22] Carla Limongelli,et al. Design and Implementation of Symbolic Computation Systems , 1996, Lecture Notes in Computer Science.
[23] Andrei Voronkov,et al. Monadic Simultaneous Rigid E-Unification and Related Problems , 1997, ICALP.
[24] Uwe Petermann. A Complete Connection Calculus with Rigid E-Unification , 1994, JELIA.
[25] Andrei Voronkov,et al. What You Always Wanted to Know About Rigid E-Unification , 1996, JELIA.
[26] Seif Haridi,et al. An Intuitionistic Predicate Logic Theorem Prover , 1989, J. Log. Comput..
[27] Margus Veanes. Uniform representation of recursively enumerable sets with simultaneous rigid E-unification , 1996 .
[28] James W. Garson,et al. Quantification in Modal Logic , 1984 .
[29] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .
[30] Andrei Voronkov,et al. Equality Elimination for the Tableau Method , 1996, DISCO.
[31] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[32] Stig Kanger,et al. A Simplified Proof Method for Elementary Logic , 1959 .
[33] Margus Veanes,et al. On Simultaneous Rigid E-Unification , 1997 .
[34] Natarajan Shankar,et al. Proof Search in the Intuitionistic Sequent Calculus , 1992, CADE.
[35] Andrei Voronkov,et al. Theorem Proving in Non-Standard Logics Based on the Inverse Method , 1992, CADE.
[36] Andrei Voronkov,et al. Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification , 1998, Journal of Automated Reasoning.
[37] V. P. Orevkov. Solvable classes of pseudoprenex formulas , 1980 .
[38] Andrei Voronkov,et al. Simultaneous rigid E-unification and related algorithmic problems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.