How can we prove that a proof search method is not an instance of another?

Authors:
Guillaume Burel;Gilles Dowek
Affiliations:
Nancy-Université and LORIA;École polytechnique and INRIA, LIX, Palaiseau Cedex, France
Venue:
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Year:
2009

Citing 4
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
What Is a Theory?

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

Embedding deduction modulo into a prover

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a method to prove that a proof search method is not an instance of another. As an example of application, we show that Polarized resolution modulo, a method that mixes clause selection restrictions and literal selection restrictions, is not an instance of Ordered resolution with selection.