#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1975

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leo Bachmair, Harald Ganzinger
- Handbook of Automated Reasoning
- 2001

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,… (More)

- Leo Bachmair, Harald Ganzinger
- J. Log. Comput.
- 1994

We present various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses. Refutation completeness is established via… (More)

The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more sophisticated (lazy… (More)

- Leo Bachmair, Harald Ganzinger
- CADE
- 1990

We consider a restricted version of ordered paramodulation, called strict superposition. We show that strict superposition (together with equality resolution) is refutationally complete for Horn… (More)

- Harald Ganzinger, Konstantin Korovin
- 18th Annual IEEE Symposium of Logic in Computer…
- 2003

We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by proposition tests. We give a model… (More)

- Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
- Inf. Comput.
- 1995

We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspired by the basic strategy for narrowing), in which paramodulation inferences are forbidden at terms… (More)

- Leo Bachmair, Harald Ganzinger
- J. ACM
- 1998

We propose inference systems for binary relations that satisfy composition laws such as transitivity. Our inference mechanisms are based on standard techniques from term rewriting and represent a… (More)

- Leo Bachmair, Harald Ganzinger
- CADE
- 1994

We design new inference systems for total orderings by applying rewrite techniques to chaining calculi. Equality relations may either be specified axiomatically or built into the deductive calculus… (More)

- Harald Ganzinger, David A. McAllester
- IJCAR
- 2001

Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper gives a new meta-complexity… (More)

- David A. Basin, Harald Ganzinger
- J. ACM
- 2001

We define order locality to be a property of clauses relative to a term ordering. This property generalizes the subformula property for proofs where the terms appearing in proofs can be bounded,… (More)