Polarized Resolution Modulo
Author:
Open Access
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 182-196
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Embedding Deduction Modulo into a ProverLecture Notes in Computer Science, 2010
- Resolution is Cut-FreeJournal of Automated Reasoning, 2009
- How can we prove that a proof search method is not an instance of another?2009
- Theorem Proving ModuloJournal of Automated Reasoning, 2003
- What Is a Theory?Lecture Notes in Computer Science, 2002
- HOL-λσ: an intentional first-order expression of higher-order logicMathematical Structures in Computer Science, 2001
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Resolution in type theoryThe Journal of Symbolic Logic, 1971
- Automatic Theorem Proving With Renamable and Semantic ResolutionJournal of the ACM, 1967
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965