Proving the termination of a recursively defined algorithm requires a certain creativity of the (human or automated) reasoner for inventing a hypothesis whose truth implies that the algorithmâ€¦ (More)

The f i rst-order calculus whose well formed formulas are clauses and whose sole inference rules are factor izat ion, resolution and paramodulation is extended to a many-sorted calculus. As a basisâ€¦ (More)

1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-called catch. Theâ€¦ (More)

Wolves, foxes, birds, caterpillars, and snails are animals, and there are some of each of them. Also there are some grains, and grains are plants. Every animal either likes to eat all plants or allâ€¦ (More)

Taking into account Poisson, background, amplifier, and speckle noise, we can simulate the precision of water-vapor measurements by using a 10-W average-power differential absorption lidar (DIAL)â€¦ (More)

We consider automated reasoning about recursive partial functions with decidable domain, i.e. functions computed by incompletely defined but terminating functional programs. Incomplete definitionsâ€¦ (More)

Incompletely defined programs provide an elegant and easy way to write and to reason about programs which may halt with a run time error by throwing an exception or printing an error message, e.g.â€¦ (More)