KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Sat, 04 Mar 2000 00:00:00 +0200Sat, 04 Mar 2000 00:00:00 +0200Reformulating Resolution Problems by Tactics
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/272
A straightforward formulation of a mathematical problem is mostly not ad-equate for resolution theorem proving. We present a method to optimize suchformulations by exploiting the variability of first-order logic. The optimizingtransformation is described as logic morphisms, whose operationalizations aretactics. The different behaviour of a resolution theorem prover for the sourceand target formulations is demonstrated by several examples. It is shown howtactical and resolution-style theorem proving can be combined.Manfred Kerber; Axel Präckleinarticlehttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/272Mon, 03 Apr 2000 00:00:00 +0200Beherrschbarkeit von Computersystemen
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/273
Manfred Kerber; Axel Präckleinpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/273Mon, 03 Apr 2000 00:00:00 +0200Tactics for the Improvement of Problem Formulation in Resolution-Based Theorem Proving
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/335
We transform a user-friendly formulation of aproblem to a machine-friendly one exploiting the variabilityof first-order logic to express facts. The usefulness of tacticsto improve the presentation is shown with several examples.In particular it is shown how tactical and resolution theoremproving can be combined.Manfred Kerber; Axel Präckleinpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/335Mon, 03 Apr 2000 00:00:00 +0200Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/339
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing methods, compiled rewrite rules, and a heuristic difference reduction mechanism for paramodulation. The possibility of embedding theory unification algorithms into this framework is outlined. Results are presented and discussed for several examples of equality reasoning problems in the context of an actual implementation of an automated theorem proving system (the Mkrp-system) and a fast C implementation of the completion procedure. The Mkrp-system is based on the clause graph resolution procedure. The thesis shows the indispensibility of the constraining effects of completion and rewriting for equality reasoning in general and quantifies the amount of speed-up caused by various enhancements of the basic method. The simplicity of the superposition inference rule allows to construct an abstract machine for completion, which is presented together with computation times for a concrete implementation.Axel Präckleinpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/339Mon, 03 Apr 2000 00:00:00 +0200