Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
991
Evaluating general purpose automated theorem proving systems
- Artificial Intelligence
"... A key concern of ATP research is the development of more powerful systems, capable of solving more difficult problems within the same resource limits. In order to build more powerful systems, it is important to understand which systems, and hence which techniques, work well for what types of problem ..."
Abstract
-
Cited by 34 (14 self)
- Add to MetaCart
of problems. This paper deals with the empirical evaluation of general purpose ATP systems, to determine which systems work well for what types of problems. This requires also dealing with the issues of assigning ATP problems into classes that are reasonably homogeneous with respect to the ATP systems
Principles of Constraint Programming
, 2000
"... Introduction 1.1 Preliminaries Constraint programming is an alternative approach to programming in which the programming process is limited to a generation of requirements (constraints) and a solution of these requirements by means of general or domain specific methods. The general methods are us ..."
Abstract
-
Cited by 258 (3 self)
- Add to MetaCart
: ffl a program that solves systems of linear equations, ffl a package for linear programming, ffl an implementation of the unification algorithm, a cornerstone of automated theorem proving. Problems that can be solved in a natural way by means of constraint programming are usually those for which
Effective Theorem Proving for Hardware Verification
, 1994
"... . The attractiveness of using theorem provers for system design verification lies in their generality. The major practical challenge confronting theorem proving technology is in combining this generality with an acceptable degree of automation. We describe an approach for enhancing the effectiveness ..."
Abstract
-
Cited by 40 (6 self)
- Add to MetaCart
. The attractiveness of using theorem provers for system design verification lies in their generality. The major practical challenge confronting theorem proving technology is in combining this generality with an acceptable degree of automation. We describe an approach for enhancing
Theorem Proving and Program Synthesis with Oyster
- In Proceedings of the IMA Unified Computation Laboratory
, 1990
"... Martin-Lof type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by des ..."
Abstract
- Add to MetaCart
this by describing the synthesis of a simple evaluator for arithmetic expressions in the system. 1 Introduction There is currently much interest in providing tools for computer-aided reasoning about programs. This can be done using a general purpose theorem prover. For example, the Boyer and Moore theorem prover
Automated Theorem Proving in Software Engineering
"... Introduction. The quickly rising amount and complexity of developed and used software require more and more a rigorous application of formal methods during the entire software life cycle. Points of particular interest include: specification and its refinements, program synthesis, software reuse, sup ..."
Abstract
-
Cited by 31 (3 self)
- Add to MetaCart
used to tackle those proof tasks. These systems have a highly expressive input language (mostly higher order logic), but in general many interactions by an expert user have to be performed for each proof task. Interactive theorem provers (ITPs) are just too interactive. On the other hand, Model
Integrating LTL Model Checking with Automated Theorem Proving
"... Theorem proving is a general-purpose verification technique that typically needs to be guided by human insight whereas model checking works in the more constrained domain of essentially finite-state systems but is largely automatic. There are several advantages to integrating the two techniques sinc ..."
Abstract
- Add to MetaCart
Theorem proving is a general-purpose verification technique that typically needs to be guided by human insight whereas model checking works in the more constrained domain of essentially finite-state systems but is largely automatic. There are several advantages to integrating the two techniques
Automated Theorem Proving for General Game Playing
"... A general game player is a system that understands the rules of an unknown game and learns to play this game well without human intervention. To succeed in this endeavor, systems need to be able to extract and prove game-specific knowledge from the mere game rules. We present a practical approach to ..."
Abstract
-
Cited by 12 (10 self)
- Add to MetaCart
to this challenge with the help of Answer Set Programming. The key idea is to reduce the automated theorem proving task to a simple proof of an induction step and its base case. We prove correctness of this method and report on experiments with an offthe-shelf Answer Set Programming system in combination with a
Scaling Question Answering to the Web
, 2001
"... The wealth of information on the web makes it an attractive resource for seeking quick answers to simple, factual questions such as "who was the first American in space?" or "what is the second tallest mountain in the world?" Yet today's most advanced web search services (e. ..."
Abstract
-
Cited by 238 (16 self)
- Add to MetaCart
to be the first general-purpose, fully-automated question-answering system available on the web. Second, we describe MULDER's architecture, which relies on multiple search-engine queries, natural-language parsing, and a novel voting procedure to yield reliable answers coupled with high recall. Finally, we
Commonsense Reasoning meets Theorem Proving
"... Abstract. The area of commonsense reasoning aims at the creation of systems able to simulate the human way of rational thinking. This paper describes the use of automated reasoning methods for tackling commonsense reasoning benchmarks. For this we use a benchmark suite introduced in the literature. ..."
Abstract
- Add to MetaCart
Abstract. The area of commonsense reasoning aims at the creation of systems able to simulate the human way of rational thinking. This paper describes the use of automated reasoning methods for tackling commonsense reasoning benchmarks. For this we use a benchmark suite introduced in the literature
Theorem Proving in Higher Order Logics
, 2002
"... Syntax in Nuprl ::::::::::::::::::::::::::::::::::::::::::::: 23 Eli Barzilay, Stuart Allen DOVE: a Graphical Tool for the Analysis and Evaluation of Critical Systems :::::::::::::::::::::: 33 Tony Cant, Jim McCarthy, Brendan Mahony Formalising General Correctness ::::::::::::::::::::::::::::::: ..."
Abstract
- Add to MetaCart
Syntax in Nuprl ::::::::::::::::::::::::::::::::::::::::::::: 23 Eli Barzilay, Stuart Allen DOVE: a Graphical Tool for the Analysis and Evaluation of Critical Systems :::::::::::::::::::::: 33 Tony Cant, Jim McCarthy, Brendan Mahony Formalising General Correctness
Results 1 - 10
of
991
