Cut Admissibility by Saturation
暂无分享,去创建一个
[1] Damien Doligez,et al. Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo , 2013, LPAR.
[2] Simon Kaplan,et al. Conditional Term Rewriting Systems , 1987, Lecture Notes in Computer Science.
[3] Claude Kirchner,et al. Theorem Proving Modulo , 2003, Journal of Automated Reasoning.
[4] Claude Kirchner,et al. HOL-λσ: an intentional first-order expression of higher-order logic , 2001, Mathematical Structures in Computer Science.
[5] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .
[6] L. Bachmair,et al. Completion without Failure 1 , 1989 .
[7] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .
[8] Nikolaj Bjørner,et al. Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings , 2011, CADE.
[9] Gilles Dowek,et al. Arithmetic as a Theory Modulo , 2005, RTA.
[10] Olivier Hermant,et al. Resolution is Cut-Free , 2010, Journal of Automated Reasoning.
[11] Kim G. Larsen,et al. Memory Efficient Data Structures for Explicit Verification of Timed Systems , 2014, NASA Formal Methods.
[12] Harald Ganzinger,et al. Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..
[13] Gilles Dowek,et al. Confluence as a Cut Elimination Property , 2003, RTA.
[14] Joe Hurd,et al. The OpenTheory Standard Theory Library , 2011, NASA Formal Methods.
[15] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[16] Gilles Dowek,et al. What Is a Theory? , 2002, STACS.
[17] Nachum Dershowitz,et al. Confluence of Conditional Rewrite Systems , 1988, CTRS.
[18] Guillaume Burel. Experimenting with Deduction Modulo , 2011, CADE.
[19] Denis Cousineau,et al. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo , 2007, TLCA.
[20] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[21] David Delahaye,et al. Tableaux Modulo Theories Using Superdeduction - An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover , 2012, IJCAR.
[22] Sam Lindley,et al. Extensional Rewriting with Sums , 2007, TLCA.
[23] Maurice Nivat,et al. Resolution of Equations in Algebraic Structures , 1989 .
[24] Sergei G. Vorobyov,et al. On the arithmetic inexpressiveness of term rewriting systems , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[25] Gilles Dowek,et al. Cut elimination for Zermelo set theory , 2023, ArXiv.
[26] Gilles Dowek,et al. Polarized Resolution Modulo , 2010, IFIP TCS.
[27] Larry Wos,et al. What Is Automated Reasoning? , 1987, J. Autom. Reason..
[28] Harald Ganzinger,et al. Superposition with equivalence reasoning and delayed clause normal form transformation , 2005, Inf. Comput..
[29] Esther König,et al. A Hypothetical Reasoning Algorithm for Linguistic Analysis , 1994, J. Log. Comput..
[30] Harald Ganzinger,et al. Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.
[31] Andrei Voronkov,et al. Equality Reasoning in Sequent-Based Calculi , 2001, Handbook of Automated Reasoning.
[32] Frank Wolter,et al. Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.
[33] Guillaume Burel,et al. Translating HOL to Dedukti , 2015, PxTP@CADE.