作者: 可能性 時間: 2025-3-21 20:30 作者: 揭穿真相 時間: 2025-3-22 03:45 作者: opinionated 時間: 2025-3-22 04:55 作者: 統(tǒng)治人類 時間: 2025-3-22 08:55 作者: 從屬 時間: 2025-3-22 15:39
https://doi.org/10.1007/978-3-663-01932-9ension of known strategies to guide induction proofs. Criteria are developed which justify the soundness of the computed induction axioms without requiring additional proofs. The performance of the new technique is illustrated by some non-trivial problems for which necessary induction hypotheses are generated automatically.作者: 殘忍 時間: 2025-3-22 17:39 作者: Spongy-Bone 時間: 2025-3-22 21:35 作者: indemnify 時間: 2025-3-23 04:49 作者: 旅行路線 時間: 2025-3-23 05:33
A method for building models automatically. Experiments with an extension of OTTER, are given, in particular a new automatic solution of the ternary algebra problem first solved by Winker..The examples emphasize the . to model building allowed by the ideas underlying our method and the usefulness of using constrained clauses. Several problems open by the present work are the main lines of future work.作者: badinage 時間: 2025-3-23 09:45 作者: endarterectomy 時間: 2025-3-23 14:15
0302-9743 ce in June/July 1994..The 67 papers presented were selected from 177 submissions and document many of the most important research results in automated deduction since CADE-11 was held in June 1992. The volume is organized in chapters on heuristics, resolution systems, induction, controlling resoluti作者: CAB 時間: 2025-3-23 20:20
Italian and Italian American Studiesased on Knuth-Bendix completion, but these procedures are limited by the use of rewriting (or rewriting-like) inferences. Our procedure avoids this limitation by making explicit the implicit induction realized by these procedures. As a result, arbitrary deduction mechanisms can be used while still allowing mutual induction.作者: savage 時間: 2025-3-23 22:52
Giuseppe Peano between Mathematics and Logicalidity of equations in the initial algebra from existing results on narrowing. Furthermore we show that several results on completeness of position selection strategies for narrowing are special cases of a generalization of a result on covering sets presented by Bachmair.作者: 鴿子 時間: 2025-3-24 05:42
https://doi.org/10.1007/978-1-4020-6496-8fs. The specialisation techniques developed in this paper are applied to first order clausal theorem provers, but are independent of the logic and the proof system and can therefore be applied to all theorem provers written as logic programs.作者: Cumbersome 時間: 2025-3-24 08:27
Timothy E. Quill,Bernard Lo,Dan W. Brockaking, adding and deleting function symbols. Such changes of a term are encoded by an efficiently decidable clause set. The satisfiability of such a set ensures that the goal containing the term under consideration cannot contribute to a successful derivation.作者: engrossed 時間: 2025-3-24 12:58
Induction using term orderings,ased on Knuth-Bendix completion, but these procedures are limited by the use of rewriting (or rewriting-like) inferences. Our procedure avoids this limitation by making explicit the implicit induction realized by these procedures. As a result, arbitrary deduction mechanisms can be used while still allowing mutual induction.作者: abnegate 時間: 2025-3-24 17:39 作者: bibliophile 時間: 2025-3-24 20:49 作者: 類似思想 時間: 2025-3-24 23:42 作者: vitreous-humor 時間: 2025-3-25 05:43 作者: 袖章 時間: 2025-3-25 08:06 作者: BABY 時間: 2025-3-25 14:34 作者: concentrate 時間: 2025-3-25 16:11 作者: 聽寫 時間: 2025-3-25 23:07 作者: ALB 時間: 2025-3-26 01:23
https://doi.org/10.1007/978-3-319-50538-1tensions of specifications cannot destroy the validity of (already proved) inductive properties. Finally we show how various notions of inductive validity in the literature fit in or are related to our classification.作者: 休息 時間: 2025-3-26 07:20 作者: 整潔 時間: 2025-3-26 08:33 作者: 谷類 時間: 2025-3-26 14:58
N. Rietbrock,B. G. Woodcock,U. Hrazdilrging proof attempts. The critic proposes lemmas and generalizations which hopefully allow the proof to go through without divergence. The critic enables the system SPIKE to prove many theorems completely automatically from the definitions alone.作者: Anticoagulant 時間: 2025-3-26 18:34 作者: Inflated 時間: 2025-3-26 23:37 作者: Acquired 時間: 2025-3-27 03:14
Italian and Italian American Studiesows to tackle theorems whose proofs requires complicated noetherian induction. We also give a disproof theorem, which is not only useful to prove that a conjecture is false but is also used to shorten the proof search of a theorem. We show applications of the method to fragments of arithmetic.作者: 配置 時間: 2025-3-27 07:31
https://doi.org/10.1007/3-540-58156-1Automatisches Schlie?en; KI-Logiken; Logic Programming; Logisches Prorammieren; Term Rewriting; Term-Erse作者: Femish 時間: 2025-3-27 12:32 作者: Iatrogenic 時間: 2025-3-27 13:42 作者: Vsd168 時間: 2025-3-27 19:11
The search efficiency of theorem proving strategies,e search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. We also discuss clause linking, a new procedure that uses a reduction to propositional calculus, and show that it, together with methods that cache subgoals, have behavior that is more favorable in some respects.作者: aesthetician 時間: 2025-3-28 01:39
Model elimination without contrapositives,sound and complete. The corresponding proof procedures are evaluated by a number of runtime experiments and they are compared to other well known provers. Finally we relate our results to other calculi, namely the connection method, modified problem reduction format and Near-Horn Prolog.作者: Afflict 時間: 2025-3-28 03:28 作者: malign 時間: 2025-3-28 10:09 作者: Precursor 時間: 2025-3-28 11:16
N. Rietbrock,M. Schlepper,E. Busanny-Caspari While in general the recursion orderings of the given function definitions form the induction ordering this approach often fail for existence proofs. In many cases a completely new induction ordering has to be invented to prove an existence formula. In this paper we describe a top-down approach for作者: 突襲 時間: 2025-3-28 14:37 作者: BOLUS 時間: 2025-3-28 19:48
https://doi.org/10.1007/978-3-322-83974-9e search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. We also discuss clause linking, a new procedure that uses a reduction to propositional calculus, and show that it, together with methods that cache subgoals, have behavior that is more favorabl作者: crumble 時間: 2025-3-29 01:49 作者: 不感興趣 時間: 2025-3-29 06:16
Kartenabbildungen und Gitternetze,sound and complete. The corresponding proof procedures are evaluated by a number of runtime experiments and they are compared to other well known provers. Finally we relate our results to other calculi, namely the connection method, modified problem reduction format and Near-Horn Prolog.作者: Detoxification 時間: 2025-3-29 10:55
Italian and Italian American Studies lemmas whose proofs use the theorems . while the theorems themselves use the lemmas. This feature has always been supported by induction procedures based on Knuth-Bendix completion, but these procedures are limited by the use of rewriting (or rewriting-like) inferences. Our procedure avoids this li作者: Accord 時間: 2025-3-29 12:54 作者: Mirage 時間: 2025-3-29 16:07
Giuseppe Peano between Mathematics and Logicay be used to simulate each other. This allows for the migration of results between the two process descriptions. We obtain decidability results for validity of equations in the initial algebra from existing results on narrowing. Furthermore we show that several results on completeness of position s作者: Mindfulness 時間: 2025-3-29 22:52 作者: Stress 時間: 2025-3-30 02:16 作者: MUMP 時間: 2025-3-30 07:45
Timothy E. Quill,Bernard Lo,Dan W. Brock input. During the search for the proof, ground instances of the input clauses are generated and new semantic structures are built based on the input semantics and a model of the ground clause set. A proof is found if the ground clause set is unsatisfiable. We give some results in proving hard theor作者: 艱苦地移動 時間: 2025-3-30 11:09
https://doi.org/10.1007/978-1-4020-6496-8nstrate how these techniques can prune the search space of the theorem prover, by detecting inference rules and clauses that cannot contribute to proofs. The specialisation techniques developed in this paper are applied to first order clausal theorem provers, but are independent of the logic and the作者: 嬰兒 時間: 2025-3-30 13:14 作者: hegemony 時間: 2025-3-30 19:34 作者: 糾纏 時間: 2025-3-30 23:21
Definitions and Categorizations,Generalisation is currently a major theorem-proving problem. This paper proposes a new method of generalisation, involving the use of explanation-based generalisation within a new domain, which may succeed when other methods fail. The method has been implemented for simple arithmetical examples.作者: Connotation 時間: 2025-3-31 03:09 作者: Classify 時間: 2025-3-31 08:26 作者: 廢止 時間: 2025-3-31 13:01 作者: BOLT 時間: 2025-3-31 16:03 作者: 不幸的人 時間: 2025-3-31 19:54
