Solving First-Order Constraints over the Monadic Class
暂无分享,去创建一个
[1] Andrei Voronkov. Herbrand's theorem, automated reasoning and semantic tableaux , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[2] Alan Robinson,et al. The Inverse Method , 2001, Handbook of Automated Reasoning.
[3] Y. Gurevich. The decision problem for the logic of predicates and of operations , 1969 .
[4] Vincent Danos,et al. The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs , 1993, Kurt Gödel Colloquium.
[5] Wilfrid Hodges,et al. Model Theory: The existential case , 1993 .
[6] Andrei Voronkov. The Ground-Negative Fragment of First-Order Logic Is Pip2-Complete , 1999, J. Symb. Log..
[7] Wayne Snyder,et al. Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.
[8] Andrei Voronkov,et al. Strategies in Rigid-Variable Methods , 1997, IJCAI.
[9] Harry R. Lewis,et al. Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..
[10] Albert R. Meyer,et al. WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .
[11] Andrei Voronkov,et al. Equality Reasoning in Sequent-Based Calculi , 2001, Handbook of Automated Reasoning.
[12] Andrei Voronkov. Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem , 1999, Theor. Comput. Sci..
[13] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[14] Margus Veanes,et al. The Undecidability of Simultaneous Rigid E-Unification with Two Variables , 1997, Kurt Gödel Colloquium.