L Ω UI : L ovely Ω mega U ser I nterface

Source: CiteSeer


. The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LOmega UI is the multi-modal interface that combines several features: a graphical display of information in a proof graph, a selective term browser with hypertext facilities, proof and proof plan presentation in natural language, and an editor for adding and maintaining the knowledge base. LOmega UI is realized in an agent-based client-server architecture and implemented in the concurrent constraint programming language Oz. 1. Introduction The effective use of an interactive theorem proving system depends not least on the capabilities of its user interface. A major problem is the adequate access to the overwhelming amount of information manipulated by these systems. This requires structure-oriented overview facilities, and selective and precise contentoriented display. The LOmega UI system is a state-of-the-art user interface forOmega mega, a ...

Download full-text


Available from: Christoph Benzmüller, Nov 18, 2014
19 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Knowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which swings the motivational pendulum back to its AI origins in that it employs and further develops many AI principles and techniques such as hierarchical planning, knowledge representation in frames and control-rules, constraint solving, tactical and meta-level reasoning. It differs from traditional search-based techniques in ATP not least with respect to its level of abstraction: the proof of a theorem is planned at an abstract level and an outline of the proof is found. This outline, i.e., the abstract proof plan, can be recursively expanded and it will thus construct a proof within a logical calculus. The plan operators represent mathematical techniques familiar to a working mathematician. While the knowledge of a domain is specific to the mathematical field, the representational techniques and reasoning procedures are general-purpose. The general-purpose planner makes use of this mathematical domain knowledge and of the guidance provided by declaratively represented control-rules which correspond to mathematical intuition about how to prove a theorem in a particular situation. These rules provide a basis for meta-level reasoning and goal-directed behaviour. We demonstrate our approach for the mathematical domain of limit theorems, which was proposed as a challenge to automated theorem proving by the late Woody Bledsoe. Using the proof planner of the Ωmega system we were able to solve all the well known challenge theorems including those that cannot be solved by any of the existing traditional systems.
    Artificial Intelligence 11/1999; 115(1-115):65-105. DOI:10.1016/S0004-3702(99)00076-4 · 3.37 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Hierarchical proof presentations are ubiquitous within logic and computer science, but have made little impact on mathematics in general. The reasons for this are not currently known, and need to be understood if mathematical knowledge management systems are to gain acceptance in the mathematical community. We report on some initial experiments with three users of a set of web-based hierarchical proofs, which suggest that usability problems could be a factor. In order to better understand these problems we present a theoretical analysis of hierarchical proofs using Cognitive Dimensions (6). The analysis allows us to formulate some concrete hypotheses about the usability of hierarchical proof presentations.
    Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings; 01/2003