# Resolution Theorem Proving

@inproceedings{Bachmair2001ResolutionTP, title={Resolution Theorem Proving}, author={Leo Bachmair and Harald Ganzinger}, booktitle={Handbook of Automated Reasoning}, year={2001} }

- Published in Handbook of Automated Reasoning 2001
DOI:10.1016/B978-044450813-3/50004-7

Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered from a large search space generated by unguided selection of gound instances of quantiied formulas. The… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 268 CITATIONS

## Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)

VIEW 9 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Engineering optimisations in query rewriting for OBDA

VIEW 14 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Resolution with Order and Selection for Hybrid Logics

VIEW 22 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## The Inverse Method

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## A Verified Automatic Prover Based on Ordered Resolution

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Abduction in first order logic with equality

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Query Rewriting Under Ontology Change

VIEW 4 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Defining the meaning of TPTP formatted proofs

VIEW 8 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Engineering optimisations

VIEW 13 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**61**Highly Influenced Citations**Averaged 10 Citations**per year from 2017 through 2019

#### References

##### Publications referenced by this paper.

SHOWING 1-4 OF 4 REFERENCES

## A computing procedure for quantiication theory

## Give a resolution proof that the Skolem normal form formula generated in problem 1 is unsatissable

## Give a resolution proof that the following two clauses are unsatissable P (x; y) _ P (y; x) :P (x; y) _ :P (y; x) Hint: consider the case where x equals

#### Similar Papers

Loading similar papers…