ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2001-07-01
    Print ISSN: 0747-7171
    Electronic ISSN: 1095-855X
    Topics: Computer Science , Mathematics
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 1996-02-15
    Print ISSN: 0178-3564
    Electronic ISSN: 0949-2925
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Informatik, Forschung und Entwicklung 11 (1996), S. 20-26 
    ISSN: 0949-2925
    Keywords: Schlüsselwörter: Automatisches Beweisen, mathematische Assistenzsysteme, Beweisentwicklungsumgebung, Beweisplanung, Analogie, Beweispräsentation ; Key words: Automated theorem proving, mathematical assistance systems, proof development environment, proof planning, analogy, proof presentation ; CR Classification:I.2.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract. The proof development environment $\Omega$ -Mkrpis intended to lend automated assistance to mathematicians in one of their main activities – the proving of mathematical theorems – in such a way that the system is a help, not a hindrance. Among the requisites for such a system are: an expressive object language; a way to speak abstractly about proof plans; a human-oriented presentation of constructed proofs; extensive assistance in filling proof gaps. The $\Omega$ -Mkrpsystem presented in the following is an attempt to meet these requirements by fusing the paradigms of fully automated, interactive, and plan-based theorem proving into a single framework. This article gives a survey of our work with this system.
    Notes: Zusammenfassung. Die Beweisentwicklungsumgebung $\Omega$ -Mkrpsoll Mathematiker bei einer ihrer Haupttätigkeiten, nämlich dem Beweisen mathematischer Theoreme unterstützen. Diese Unterstützung muß so komfortabel sein, daß die rechnergestützte Suche nach formalen Beweisen leichter und insbesondere weniger aufwendig ist, als ohne das System. Dazu muß die verwendete Objektsprache ausdrucksstark sein, man muß die Möglichkeit haben, abstrakt über Beweispläne zu reden, die gefundenen Beweise müssen in einer am Menschen orientierte Form präsentiert werden und vor allem muß eine effiziente Unterstützung beim Füllen von Beweislücken zur Verfügung stehen. Das im folgenden vorgestellte $\Omega$-Mkrp-System ist der Versuch einer Synthese der Ansätze des vollautomatischen, des interaktiven und des planbasierten Beweisens. Dieser Artikel soll eine Übersicht über unsere Arbeit an diesem System geben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 23 (1998), S. 299-320 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their domain-specific problem solving knowledge. Such knowledge is, however, intrinsically incomplete. In order to model the human ability of adapting existing methods to new situations we present in this work a declarative approach for representing methods, which can be adapted by so-called meta-methods. Since the computational success of this approach relies on the existence of general and strong meta-methods, we describe several meta-methods of general interest in detail by presenting the problem solving process of two familiar classes of mathematical problems. These examples should illustrate our philosophy of proof planning as well: besides planning with a pre-defined repertory of methods, the repertory of methods evolves with experience in that new ones are created by meta-methods that modify existing ones.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 21 (1998), S. 327-355 
    ISSN: 1573-0670
    Keywords: mechanized reasoning ; computer algebra ; hierarchical proof planning ; proof checking
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two different tasks proving and calculating. Even more important, proof and computation are often interwoven and not easily separable. In this article we advocate an integration of computer algebra into mechanized reasoning systems at the proof plan level. This approach allows us to view the computer algebra algorithms as methods, that is, declarative representations of the problem-solving knowledge specific to a certain mathematical domain. Automation can be achieved in many cases by searching for a hierarchic proof plan at the method level by using suitable domain-specific control knowledge about the mathematical algorithms. In other words, the uniform framework of proof planning allows us to solve a large class of problems that are not automatically solvable by separate systems. Our approach also gives an answer to the correctness problems inherent in such an integration. We advocate an approach where the computer algebra system produces high-level protocol information that can be processed by an interface to derive proof plans. Such a proof plan in turn can be expanded to proofs at different levels of abstraction, so the approach is well suited for producing a high-level verbalized explication as well as for a low-level, machine-checkable, calculus-level proof. We present an implementation of our ideas and exemplify them using an automatically solved example. Changes in the criterion of ‘rigor of the proof' engender major revolutions in mathematics. H. Poincaré, 1905
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 18 (1996), S. 221-241 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a method to optimize formulations of mathematical problems by exploiting the variability of first-order logic. The optimizing transformation is described as logic morphisms, whose operationalizations are tactics. The different behaviour of a resolution theorem prover for the source and target formulations is demonstrated by several examples. Such tactics give a user the possibility to formally manipulate problem formulations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...