#### Filter Results:

- Full text PDF available (29)

#### Publication Year

1975

2017

- This year (4)
- Last 5 years (17)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Leo Bachmair, Harald Ganzinger, Uwe Waldmann
- LICS
- 1993

- Leo Bachmair, Harald Ganzinger, Uwe Waldmann
- Kurt Gödel Colloquium
- 1993

We show that strict superposition, a restricted form of paramodulation, can be combined with specifically designed simplification rules such that it becomes a decision procedure for the monadic class with equality. The completeness of the method follows from a general notion of redundancy for clauses and superposition inferences.

- Harald Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann
- Inf. Comput.
- 2006

The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a consequence of the fact that all the inferences are pure – only involving clauses over the alphabet of either one, but not both, of the theories – when refuting goals represented by… (More)

- Michel Ludwig, Uwe Waldmann
- LPAR
- 2007

The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the… (More)

- Harald Ganzinger, Uwe Waldmann
- CTRS
- 1992

- Peter Baumgartner, Uwe Waldmann
- CADE
- 2013

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are “reasonably complete” even in the presence of free function symbols ranging into a background theory sort. The hierarchic… (More)

- Leo Bachmair, Harald Ganzinger, Uwe Waldmann
- Applicable Algebra in Engineering, Communication…
- 1994

We extend previous results on theorem proving for first-order clauses with equality to hierarchic first-order theories. Semantically such theories are confined to conservative extensions of the base models. It is shown that superposition together with variable abstraction and constraint refutation is refutationally complete for theories that are… (More)

- Werner Damm, Stefan Disch, +6 authors Boris Wirtz
- ATVA
- 2007

We propose algorithms significantly extending the limits for maintaining exact representations in the verification of linear hybrid systems with large discrete state spaces. We use AND-Inverter Graphs (AIGs) extended with linear constraints (LinAIGs) as symbolic representation of the hybrid state space, and show how methods for maintaining compactness of… (More)

- Uwe Waldmann
- 1997

- Harald Ganzinger, Uwe Waldmann
- CADE
- 1996