Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
223 hits
in 72,223,834 documents
in 0.71 seconds
Please leave the following field blank:
Home
»
Search: Christoph Walther
Hit List
Hit list
1.
Secondorder matching modulo evaluation  A technique for reusing proofs
Open Access
Title:
Secondorder matching modulo evaluation  A technique for reusing proofs
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
in our prototype of a learning prover, the PLAGlATORsystem [Brauburger, 1994], has proved successful for many examples, including those from Table 1. Hence we are able to verify these conjectures by automatically reusing the proofs of previously proved, similar conjectures. As a side effect useful lemmata are speculated by our method. Table 1 a...
in our prototype of a learning prover, the PLAGlATORsystem [Brauburger, 1994], has proved successful for many examples, including those from Table 1. Hence we are able to verify these conjectures by automatically reusing the proofs of previously proved, similar conjectures. As a side effect useful lemmata are speculated by our method. Table 1 also suggests a recursive organization of the reuse procedure as the proof obligations returned by our solution algorithm may also be proved by reuse. The (heuristic) control of this recursion for avoiding nontermination by cyclic reuses is subject to future work. Another future topic is concerned with the management of learned schematic proofs for an efficient selection of the proof shell which is to be reused for a
Minimize
Publisher:
IJCAI, Morgan Kaufmann
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120304
Source:
http://ijcai.org/Past%20Proceedings/IJCAI95VOL%201/pdf/025.pdf
http://ijcai.org/Past%20Proceedings/IJCAI95VOL%201/pdf/025.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.9383
http://ijcai.org/Past%20Proceedings/IJCAI95VOL%201/pdf/025.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.9383
http://ijcai.org/Past%20Proceedings/IJCAI95VOL%201/pdf/025.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Secondorder matching modulo evaluation  a technique for reusing proofs
Open Access
Title:
Secondorder matching modulo evaluation  a technique for reusing proofs
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
Abstract 1 We investigate the improvement of theorem provers by reusing previously computed proofs. A proof of a conjecture is generalized by replacing function symbols with function variables. This yields a schematic proof of a schematic conjecture which is instantiated subsequently for obtaining proofs of new, similar conjectures. Our reuse me...
Abstract 1 We investigate the improvement of theorem provers by reusing previously computed proofs. A proof of a conjecture is generalized by replacing function symbols with function variables. This yields a schematic proof of a schematic conjecture which is instantiated subsequently for obtaining proofs of new, similar conjectures. Our reuse method requires solving socalled free function variables, i.e. variables which cannot be instantiated by matching the schematic conjecture with a new conjecture. We develop an algorithm for solving free function variables by combining the techniques of symbolic evaluation and secondorder matching. Heuristicsfor controlling the algorithm are presented, and several examples demonstrate their usefulness. We also show how our reuse proposal supports the discovery of useful lemmata. 1
Minimize
Publisher:
Morgan Kaufmann
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080717
Source:
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/
walther
/Paper/SecondOrderMatchingmodEvalIJCAI1995.pdf
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/
walther
/Paper/SecondOrderMatchingmodEvalIJCAI1995.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.6081
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/walther/Paper/SecondOrderMatchingm...
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.6081
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/walther/Paper/SecondOrderMatchingm...
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
ARTIFICIAL INTELLIGENCE A Mechanical Solution of Schubert's Steamroller by ManySorted Resolution
Open Access
Title:
ARTIFICIAL INTELLIGENCE A Mechanical Solution of Schubert's Steamroller by ManySorted Resolution
Author:
Christoph Walther
;
Abstracf I
Christoph Walther
;
Abstracf I
Minimize authors
Description:
We demonstrate the advantage of using a manysorted resolution calculus by a mechanical solulion of automated a challenge theorem problem. provers This before. problem Our known solution as clearly 'Schubert's demonstrates Steamroller ' the power had of been a manyso unsolvedt ed bY resolution calculus. The proposed method is applicable to all ...
We demonstrate the advantage of using a manysorted resolution calculus by a mechanical solulion of automated a challenge theorem problem. provers This before. problem Our known solution as clearly 'Schubert's demonstrates Steamroller ' the power had of been a manyso unsolvedt ed bY resolution calculus. The proposed method is applicable to all resolutionbased inference systems. In 1978, problem I. Schubert's Problem Schubert of the University of Alberta set up the following challenge 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 animals much smaller than itself that like to eat some plants. Gaterpillars and snails are much smaller than birds, which are much: ' smaller than foxes, which in turn are much smaller than wolves. Wolves do not like to eat foxes or grains, while birds like to eat caterpillars but not snails. Caterpillars and snails like to eat some plants. Therefore there is an animal that likes to eat a graineating animal. This problem became well known since in spite of its apparent simplicity it turned out to be too hard for existing theorem provers because the search space is just too big. Using the following predicates as abbreviations: A(x): x is an animal, W(x): x is a wolf, F(x): x is a fox, B(x): x is a bird, C(x): x is a caterpillar, S(x): x is a snail, G(x): x is a grain, P(x): x is a plant, M(xy): x is much smaller than y, E(xy): x likes to eat y
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/
walther
/Paper/Schuberts_Steamroller_by_ManySorted_ResolutionAIJ2521985.pdf
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/
walther
/Paper/Schuberts_Steamroller_by_ManySorted_ResolutionAIJ2521985.pdf
Minimize
Document Type:
text
Language:
en
DDC:
630 Agriculture & related technologies
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.6152
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/walther/Paper/Schuberts_Steamroller_b...
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.6152
http://www.inferenzsysteme.informatik.tudarmstadt.de/users/walther/Paper/Schuberts_Steamroller_b...
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
A MachineVerified Code Generator
Open Access
Title:
A MachineVerified Code Generator
Author:
Christoph Walther
;
Stephan Schweitzer
Christoph Walther
;
Stephan Schweitzer
Minimize authors
Description:
We consider the machinesupported verification of a code syntax trees which may be obtained by a parser from programs of an imperative programming language. We motivate the representation of states developed for the verification, which is crucial for success, as the interpretation of treestructured WHILEprograms differs significantly in its op...
We consider the machinesupported verification of a code syntax trees which may be obtained by a parser from programs of an imperative programming language. We motivate the representation of states developed for the verification, which is crucial for success, as the interpretation of treestructured WHILEprograms differs significantly in its operation from the interpretation of the linear machine code. This work has been developed for a course to demonstrate to the students the support gained by computeraided verification in a central subject of computer science, boiled down to the classroomlevel. We report about the insights obtained into the properties of machine code as well as the challenges and efforts encountered when verifying the correctness of the code generator. We also illustrate the performance of the VeriFunsystem that was used for this work.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090310
Source:
http://www.inferenzsysteme.informatik.tudarmstadt.de/verifun/archive/lpar2003whilecodespringer.pdf
http://www.inferenzsysteme.informatik.tudarmstadt.de/verifun/archive/lpar2003whilecodespringer.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3467
http://www.inferenzsysteme.informatik.tudarmstadt.de/verifun/archive/lpar2003whilecodespring...
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3467
http://www.inferenzsysteme.informatik.tudarmstadt.de/verifun/archive/lpar2003whilecodespring...
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Proof Management and Retrieval
Open Access
Title:
Proof Management and Retrieval
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
Automated theorem provers might be improved if they reuse previously computed proofs. Our approach for reuse is based on socalled proof shells which are obtained from computed proofs by secondorder generalization. Each proof shell represents a schematic proof of a schematic conjecture and applies for each instance of the schematic conjecture y...
Automated theorem provers might be improved if they reuse previously computed proofs. Our approach for reuse is based on socalled proof shells which are obtained from computed proofs by secondorder generalization. Each proof shell represents a schematic proof of a schematic conjecture and applies for each instance of the schematic conjecture yielding (firstorder) proof obligations justifying a successful proof reuse. But since there may be different proofs for different instances of a schematic conjecture, we have to select a reusable proof shell among the applicable proof shells for a new conjecture. For supporting such a retrieval efficiently, the set of computed proof shells is organized by socalled proof volumes and a proof dictionary. All applicable proof shells can be accessed by searching for the right proof volume in the proof dictionary, if the applicability of proof shells is determined by socalled simple secondorder matchers.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090525
Source:
http://www.informatik.unifreiburg.de/~koehler/ijcai95/ijcaiws/kolbe.ps.gz
http://www.informatik.unifreiburg.de/~koehler/ijcai95/ijcaiws/kolbe.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4526
http://www.informatik.unifreiburg.de/~koehler/ijcai95/ijcaiws/kolbe.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4526
http://www.informatik.unifreiburg.de/~koehler/ijcai95/ijcaiws/kolbe.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Patching Proofs for Reuse
Open Access
Title:
Patching Proofs for Reuse
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
. 1 We investigate the application of machine learning paradigms in automated reasoning in order to improve a theorem prover by reusing previously computed proofs. Our reuse procedure generalizes a previously computed proof of a conjecture yielding a schematic proof which can be instantiated subsequently if a new, similar conjecture is given. We...
. 1 We investigate the application of machine learning paradigms in automated reasoning in order to improve a theorem prover by reusing previously computed proofs. Our reuse procedure generalizes a previously computed proof of a conjecture yielding a schematic proof which can be instantiated subsequently if a new, similar conjecture is given. We show that for exploiting the full flexibility of secondorder instantiations the instantiated schematic proof has to be patched such that a proof of the new conjecture is obtained. We develop an algorithm which computes patched proofs showing thereby that proof patching is always possible in a uniform way. This enables a further processing of the obtained proof, justifies the soundness of our proposal for reusing proofs, and provides a key for comparing our method with other reuse paradigms. 1 Introduction Several machine learning paradigms aim to improve a problem solver by reusing previously computed solutions, e.g. explanationbased learn.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090412
Source:
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/patProRep.ps.Z
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/patProRep.ps.Z
Minimize
Document Type:
text
Language:
en
DDC:
004 Data processing & computer science
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.7704
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/patProRep.ps.Z
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.7704
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/patProRep.ps.Z
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
Adaptation of Proofs for Reuse
Open Access
Title:
Adaptation of Proofs for Reuse
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
Automated theorem provers might be improved if they are enabled to reuse previously computed proofs. Our approach for reuse is based on generalizing computed proofs by replacing function symbols with function variables. This yields a schematic proof which is instantiated subsequently for obtaining proofs of new, similar conjectures. Our reuse me...
Automated theorem provers might be improved if they are enabled to reuse previously computed proofs. Our approach for reuse is based on generalizing computed proofs by replacing function symbols with function variables. This yields a schematic proof which is instantiated subsequently for obtaining proofs of new, similar conjectures. Our reuse method, which requires no human support, demands two steps of proof adaptation, viz. solution of socalled free function variables and patching of completely instantiated proofs. We develop algorithms for solving free function variables and for computing patched proofs and demonstrate their usefulness with several examples.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090525
Source:
http://www.aic.nrl.navy.mil/~aha/aaai95fss/papers/kolbe.ps.Z
http://www.aic.nrl.navy.mil/~aha/aaai95fss/papers/kolbe.ps.Z
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.3094
http://www.aic.nrl.navy.mil/~aha/aaai95fss/papers/kolbe.ps.Z
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.3094
http://www.aic.nrl.navy.mil/~aha/aaai95fss/papers/kolbe.ps.Z
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
Reusing Proofs
Open Access
Title:
Reusing Proofs
Author:
Thomas Kolbe
;
Christoph Walther
Thomas Kolbe
;
Christoph Walther
Minimize authors
Description:
. 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 socalled catch. The catch provides the features of the proof which are relevant for reusing it in subsequent verification tasks and may also suggest useful lemmata. Proo...
. 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 socalled catch. The catch provides the features of the proof which are relevant for reusing it in subsequent verification tasks and may also suggest useful lemmata. Proof analysis techniques for computing the catch are presented. A catch is generalized in a certain sense for increasing the reusability of proofs. We discuss problems arising when learning from proofs and illustrate our method by several examples. 1 INTRODUCTION The improvement of problem solvers by reusing previously computed solutions is an active research area of Artificial Intelligence, emerging in the methodologies of explanationbased learning (EBL) [11, 4, 5] and analogical reasoning (AR) [2, 7, 12]. In EBL a problem's solution is analyzed, yielding an explanation why the solution succeeds. After generalization, the explanation is used for.
Minimize
Publisher:
John Wiley & Sons, Ltd
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090412
Source:
http://kbibmp3.ub.unikl.de/Preprint_Informatik/PS/no_series_216.ps.gz
http://kbibmp3.ub.unikl.de/Preprint_Informatik/PS/no_series_216.ps.gz
Minimize
Document Type:
text
Language:
en
DDC:
004 Data processing & computer science
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2571
http://kbibmp3.ub.unikl.de/Preprint_Informatik/PS/no_series_216.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2571
http://kbibmp3.ub.unikl.de/Preprint_Informatik/PS/no_series_216.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Verifying the Modal Logic Cube is an Easy Task (for HigherOrder Automated Reasoners)
Open Access
Title:
Verifying the Modal Logic Cube is an Easy Task (for HigherOrder Automated Reasoners)
Author:
Christoph Benzmüller
;
Dedicated To Christoph Walther
Christoph Benzmüller
;
Dedicated To Christoph Walther
Minimize authors
Description:
Abstract. Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higherorder logic). Furthermore, offtheshelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about...
Abstract. Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higherorder logic). Furthermore, offtheshelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated verification of inclusion and equivalence relations between them. Related work has applied firstorder automated theorem provers for the task. Our solution achieves significant improvements, most notably, with respect to elegance and simplicity of the problem encodings as well as with respect to automation performance. 1
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20100928
Source:
http://www.ags.unisb.de/%7Echris/papers/B12.pdf
http://www.ags.unisb.de/%7Echris/papers/B12.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.9757
http://www.ags.unisb.de/%7Echris/papers/B12.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.9757
http://www.ags.unisb.de/%7Echris/papers/B12.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Proving Theorems by Mimicking a Human's Skill
Open Access
Title:
Proving Theorems by Mimicking a Human's Skill
Author:
Thomas Kolbe
;
Christoph Walther
;
Fachbereich Informatik
;
Technische Hochschule Darmstadt
Thomas Kolbe
;
Christoph Walther
;
Fachbereich Informatik
;
Technische Hochschule Darmstadt
Minimize authors
Description:
. 1 We investigate the improvement of theorem provers by reusing previously computed proofs. We have developed and implemented the Plagiator system which proves theorems by mathematical induction with the aid of a human advisor: If a conjecture is submitted to the system, it tries to reuse a proof of a previously verified conjecture. If successf...
. 1 We investigate the improvement of theorem provers by reusing previously computed proofs. We have developed and implemented the Plagiator system which proves theorems by mathematical induction with the aid of a human advisor: If a conjecture is submitted to the system, it tries to reuse a proof of a previously verified conjecture. If successful, resources are saved, because the number of required user interactions is decreased. The performance of the overall system is improved, because necessary lemmata might be speculated. If the reuse fails, the human advisor is called for providing a hand crafted proof for such a conjecture, which subsequently  after some (automated) preparation steps  is stored in the system's memory, to be in stock for future reasoning problems. The success of our approach is based on our technique for preparing given proofs as well as by our technique for reusing proofs. Introduction We investigate the improvement of theorem provers by reusing previ.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090412
Source:
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/aaai96.ps.Z
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/aaai96.ps.Z
Minimize
Document Type:
text
Language:
en
DDC:
004 Data processing & computer science
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9483
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/aaai96.ps.Z
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9483
http://kirmes.inferenzsysteme.informatik.thdarmstadt.de/~kolbe/aaai96.ps.Z
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(36) Andreev V
(36) Andrieu B
(36) Babaev A
(36) Ban J
(36) Baranov P
(36) Barrelet E
(36) Bartel W
(36) Bassler U
(36) Behrend H J
(36) Belousov A
(36) Berger Christoph
(36) Bernardi G
(36) BertrandCoremans G
(36) Besancon M
(36) Biddulph P
(36) Bizot J C
(36) Blobel V
(36) Borras K
(36) Boudry V
(36) Braunschweig W
(36) Bruncko D
(36) Buniatian A
(36) Burger J
(36) Burke S
(36) Busser F W
(36) Campbell A J
(36) Carli T
(36) Chekelian V I
(36) Chernyshov V
(36) Clarke D
(36) Clegg A B
(36) Coughlan J A
(36) Courau A
(36) Cozzika G
(36) Criegee L
(36) Cvach J
(36) Dainton J B
(36) Dau W D
(36) David M
(36) Delcourt B
(36) Dollfus C
(36) Dowell J D
(36) Dreis H B
(36) Duhm H
(36) Dunger O
(36) Ebert J
(36) Ebert T R
(36) Eckerlin G
(36) Efremenko V
(36) Egli S
(36) Eichler R
(36) Eisele F
(36) Eisenhandler E
(36) Elsen E
(36) Erdmann M
(36) Evrard E
(36) Favart L
(36) Fedotov A
(36) Feeken D
(36) Felst R
(36) Feltesse J
(36) Ferencei J
(36) Ferrarotto F
(36) Fleischer M
(36) Flugge G
(36) Fomenko A
(36) Formanek J
(36) Foster J M
(36) Franke G
(36) Fretwurst E
(36) Gabathuler E
(36) Garvey J
(36) Gayler J
(36) Genzel H
(36) Gerhards R
(36) Goerlach U
(36) Goerlich L
(36) Goldberg M
(36) Gorelov I
(36) Grab C
(36) Grassler H
(36) Greenshaw T
(36) Grindhammer G
(36) Gruber C
(36) Haack J
(36) Hajduk L
(36) Haynes W J
(36) Heinzelmann G
(36) Henschel H
(36) Herynek I
(36) Hildesheim W
(36) Hilton C D
(36) Hladky J
(36) Hoeger K C
(36) Ibbotson M
(36) Jacholkowska A
(36) Jacobsson C
(36) Jaffre M
(36) Jonsson L
(36) Jung H
Author:
Subject
(12) historische drucke
(10) 610 medical sciences medicine
(7) theologie
(5) 610 medicine health
(5) engineering
(5) vd18 digital
(4) 610
(4) ddc 610
(4) orthopedics
(3) 55 iwk 2010
(3) article
(3) für harvesting bereitgestellt
(3) klasse a
(3) original articles
(3) research article
(3) sprachen literaturen
(2) 000 allgemeines
(2) 000 informatik informationswissenschaft
(2) 330 wirtschaft
(2) 80 and over
(2) aged
(2) allgemeine werke
(2) bioinformatics
(2) biophysics
(2) ddc 090
(2) ddc 570
(2) doaj health sciences
(2) doaj internal medicine
(2) doaj medicine general
(2) elektrische schwingungstechnik elektrotechnik
(2) epidemiology
(2) kinesiology
(2) laserbauteile maserbauteile elektrotechnik
(2) lcc internal medicine
(2) lcc medicine
(2) lcc r
(2) lcc rc31 1245
(2) leichenpredigt
(2) public health
(2) qkl lasertechnik
(2) quantenkaskadenlaser
(2) versorgungsforschung
(2) wissenschaft
(1) 11 54 katholizismus
(1) 110300 clinical sciences
(1) 111200 oncology and carcinogenesis
(1) 18 w
(1) 19 630 y chromosomes were sampled from 129...
(1) 230 christianity christian theology
(1) 364
(1) 44 76 ernährungsstörungen
(1) 55 83 stadtverkehr
(1) adult
(1) air embolism
(1) allgemeines wissenschaftskunde literaturgeschichte
(1) alternative
(1) anchorage
(1) and dys643 and using the powerplex y23 system...
(1) and society
(1) anrufsammeltaxi
(1) arthrodese
(1) articles
(1) aufsatzsammlung
(1) ausschreibung
(1) bense
(1) bible
(1) biophysics molecular biology f05
(1) biophysique biologie moléculaire f05
(1) biopsy
(1) carcinoma
(1) categories and subject descriptors d 2 8...
(1) charcot fuß
(1) charcotfuß mit nicht infiziertem ulcus
(1) chest tube placement
(1) collision risk
(1) collision scenario
(1) collision situation
(1) commerce
(1) communications
(1) computed tomography
(1) contemporary evolution
(1) contrast media
(1) correspondence and other communications
(1) ct guided biopsy
(1) cutting needle
(1) ddc 004
(1) ddc 300
(1) ddc 370
(1) ddc 500
(1) ddc 620
(1) ddc 790
(1) design tools and tech niques user interfaces...
(1) dissertation jur
(1) dissertation med
(1) dissertation phil
(1) dissertation theol
(1) dissertationensammlung
(1) doaj allergy and immunology
(1) doaj technology and engineering
(1) doaj transportation
Subject:
Dewey Decimal Classification (DDC)
(20) Medicine & health [61*]
(8) Computer science, knowledge & systems [00*]
(7) Psychology [15*]
(5) Life sciences; biology [57*]
(4) Economics [33*]
(3) Science [50*]
(3) Agriculture [63*]
(2) Sports, games & entertainment [79*]
(1) Philosophy [10*]
(1) Modern western philosophy [19*]
(1) Social sciences, sociology & anthropology...
(1) Statistics [31*]
(1) Education [37*]
(1) Commerce, communications & transportation...
(1) Language [40*]
(1) Physics [53*]
(1) Engineering [62*]
(1) Management & public relations [65*]
Dewey Decimal Classification (DDC):
Year of Publication
(22) 2014
(20) 2009
(18) 2013
(17) 2010
(13) 1995
(12) 2008
(10) 1996
(10) 2012
(8) 1994
(7) 2006
(7) 2007
(5) 1992
(4) 2011
(3) 1659
(3) 1664
(3) 2003
(2) 1558
(2) 1569
(2) 1653
(2) 1660
(2) 1675
(2) 1695
(2) 1712
(2) 1993
(1) 1559
(1) 1563
(1) 1571
(1) 1578
(1) 1589
(1) 1592
(1) 1602
(1) 1608
(1) 1622
(1) 1625
(1) 1629
(1) 1639
(1) 1647
(1) 1649
(1) 1651
(1) 1652
(1) 1657
(1) 1665
(1) 1666
(1) 1668
(1) 1669
(1) 1676
(1) 1679
(1) 1681
(1) 1682
(1) 1690
(1) 1696
(1) 1720
(1) 1721
(1) 1737
(1) 1738
(1) 1753
(1) 1754
(1) 1852
(1) 1868
(1) 1884
(1) 1887
(1) 1909
(1) 1997
(1) 1999
(1) 2000
(1) 2002
(1) 2004
(1) 2015
Year of Publication:
Content Provider
(36) STFC (United Kingdom)
(22) CiteSeerX
(20) DataCite Metadata Store
(12) Berlin State Library: Digitalisierte Sammlungen
(12) SachsenAnhalt ULB: Bibliotheca Ponickaviana
(11) Wolfenbüttel Digital Library (WDB)
(10) PubMed Central
(9) Aachen RWTH: Publications
(8) Basel Univ.: edoc
(7) Bern Univ.: BORIS
(6) Göttingen Univ.: GOEDOC
(4) Munich Digitisation Centre (MDZ)
(4) Bochum Univ. (RUB): Campus Research Bibliography
(4) Tübingen Univ.: Publication System
(3) Digital Library Thüringen
(3) DOAJ Articles
(3) HighWire Press
(2) BioMed Central
(2) Munich LMU: Open Access
(2) Michigan Univ.: Digital Library (DLPS)
(2) Hathi Trust Digital Library
(2) Bayreuth Univ.: ERef Bayreuth
(2) Frankfurt/Main Univ.: Publications
(2) Geneva Univ.: Archive ouverte
(2) Lodz Univ.: Digital Library
(1) ArXiv.org
(1) BioOne (USA)
(1) Göteborg Chalmers Univ. of Technology
(1) Copenhagen Univ.: CURIS
(1) dilibri (Landesbibliothekszentrum...
(1) Zurich ETH: ECollection
(1) Georgetown Univ.: DigitalGeorgetown
(1) GFZ German Research Centre for Geosciences:...
(1) Mittweida Univ. of Applied Sciences: MOnAMi
(1) London King's College: Research Portal
(1) Sydney Macquarie Univ.: ResearchOnline
(1) Max Planck Society: eDoc Server
(1) Austrian Academy of Sciences (ÖAW)
(1) RePEc.org
(1) RERO DOC Digital Library
(1) Hamburg State and Univ. Library: Digitalisierte...
(1) Taipei Medical Univ. Repository
(1) Tartu Univ.
(1) Dresden SLUB: Collections
(1) Cologne Univ.: KUPS
(1) Lund Univ. Publications (LUP)
(1) Michigan Univ.: Deep Blue
(1) São Paulo Univ.: Intellectual Production
(1) ftunivadelaide
(1) Debrecen Univ.
(1) Kaiserslautern Univ. Kluedo
(1) Leuven KU: Lirias
(1) Luxembourg Univ.: ORBilu
(1) St. Gallen Univ.: Research Platform Alexandria
(1) Stuttgart Univ.: Publication Server
(1) Zurich Univ.: ZORA
(1) Szczecin Pomeranian Library: Digital Library
(1) Berlin ZLB: Electronic Publications
Content Provider:
Language
(92) English
(68) Unknown
(45) German
(21) Latin
(1) Greek, Ancient (to 1453)
Language:
Document Type
(123) Text
(47) Article, Journals
(28) Unknown
(21) Books
(2) Reports, Papers, Lectures
(2) Theses
Document Type:
Access
(161) Unknown
(62) Open Access
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5

6

7

8

9

10

11
Next »
[23]
New Search »
Currently in BASE: 72,223,834 Documents of 3,475
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,223,834 Documents of 3,475 Content Sources
http://www.basesearch.net