Reasoning Support for Caslwith Automated Theorem Proving Systems
نویسندگان
چکیده
We connect the algebraic specification language Casl with a variety of automated first-order provers. The heart of this connection is an institution comorphism from Casl to SoftFOL (softly typed firstorder logic); the latter is then translated to the provers’ input syntaxes. We also describe a GUI integrating the translations and the provers into the Heterogeneous Tool Set. We report on experiences with provers, which led to fine-tuning of the translations. This framework can also be used for checking consistency of specifications.
منابع مشابه
Kalpa Publications in Computing
Automated reasoning systems such as theorem provers often employ interaction or cooperation with further reasoning software. Whereas in most cases the concrete choice of cooperating software is, to some extent, irrelevant, these systems are nevertheless often rigid in practice due to compatibility issues. In order to support more flexible cooperation schemes, a machine-readable description form...
متن کاملAutomated Reasoning for Computational Semantics
This paper discusses inference in computational semantics. We argue that state-of-the-art methods in rst-order theorem proving and model building are of direct relevance to inference for natural language processing. We support our claim by discussing the inferen-tial aspects of several higher discourse phenomena and reporting on an experiment where the induced deduction problems are solved by t...
متن کاملUsing Computer Algebra for Automated Reasoning in the Theorema System ABSTRACT
While most of the Automated Reasoning systems (see e.g. [8]) are based on purely logical approaches, many researchers started during the last decade to believe that solving non-trivial problems is only possible by using additionally algorithms from Computer Algebra. This is only natural, since most of human made proofs use complex computations, and in fact some researchers advocated the combina...
متن کاملRobotics, Temporal Logic and Stream Reasoning
The area of AI robotics offers a set of fundamentally challenging problems when attempting to integrate logical reasoning functionality in such systems. The problems arise in part from the high degree of complexity in such architectures which include realtime behaviour, distribution, concurrency, various data latencies in operation and several levels of abstraction. For logic to work practicall...
متن کاملSymbolic Computation and Automated Reasoning for Program Analysis
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the logically complex parts of software. The talk will first present how computer algebra methods, such as Gröbner basis computation, quantifier elimination and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006