Results 11  20
of
29,331
PSETHEO: Strategy Parallel Automated Theorem Proving
 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX98
, 1998
"... One of the key issues in Automated Theorem Proving is the search for optimal proof strategies. Since there is not one uniform strategy which works optimal on all proof tasks, one is faced with the difficult problem of selecting a good strategy for a given task. In this paper, we discuss a way of cir ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
One of the key issues in Automated Theorem Proving is the search for optimal proof strategies. Since there is not one uniform strategy which works optimal on all proof tasks, one is faced with the difficult problem of selecting a good strategy for a given task. In this paper, we discuss a way
Decomposition Techniques and their Applications in Automated Theorem Proving
, 1994
"... This paper addresses the decomposition of proofs as a means of constructing methods in planbased automated theorem proving. It shows also, how decomposition can beneficially be applied in theorem proving by analogy. Decomposition is also useful for humanstyle proof presentation. We propose several ..."
Abstract
 Add to MetaCart
This paper addresses the decomposition of proofs as a means of constructing methods in planbased automated theorem proving. It shows also, how decomposition can beneficially be applied in theorem proving by analogy. Decomposition is also useful for humanstyle proof presentation. We propose
Domain Dependencies of Automated Theorem Proving Resolution Strategies
"... The choice of computation rule in automated theorem proving systems has a great bearing on the size and structure of the corresponding search space. A number of strategies have been proposed to reduce the size of the resolution graph. However, the choice of the particular strategy, with respect to t ..."
Abstract
 Add to MetaCart
The choice of computation rule in automated theorem proving systems has a great bearing on the size and structure of the corresponding search space. A number of strategies have been proposed to reduce the size of the resolution graph. However, the choice of the particular strategy, with respect
Communication formalisms for automated theorem proving tools
 PROC. OF IJCAI18 WORKSHOP ON AGENTS AND AUTOMATED REASONING
, 2003
"... This paper describes two communication formalisms for Automated Theorem Proving (ATP) tools. First, a problem and solution language has been designed. The language will be used for writing problems to be input to ATP systems, and for writing solutions output by ATP systems. Second, a hierarchy of re ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper describes two communication formalisms for Automated Theorem Proving (ATP) tools. First, a problem and solution language has been designed. The language will be used for writing problems to be input to ATP systems, and for writing solutions output by ATP systems. Second, a hierarchy
External Sources of Axioms in Automated Theorem Proving
 In Proceedings of the 32nd Annual Conference on Artificial Intelligence, number 5803 in LNAI
"... Abstract. In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as normal internal axioms. This work addresses the issues of accessing external sources of axioms from a firstorder logic ATP ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as normal internal axioms. This work addresses the issues of accessing external sources of axioms from a firstorder logic
1 The IJCAR2004 Automated Theorem Proving Competition
"... The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems – the world championship for such systems. CASCJ2 was the ninth competition in the CASC series. Twentysix ATP systems and system variants competed in the various competi ..."
Abstract
 Add to MetaCart
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems – the world championship for such systems. CASCJ2 was the ninth competition in the CASC series. Twentysix ATP systems and system variants competed in the various
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 gamespecific 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 offtheshelf Answer Set Programming system in combination with a
Automated theorem proving by resolution in nonclassical logics
 Annals of Mathematics and Artificial Intelligence
, 2007
"... This paper is an overview of a variety of results, all centered around a common theme, namely embedding of nonclassical logics into first order logic and resolution theorem proving. We present several classes of nonclassical logics, many of which are of great practical relevance in knowledge repre ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
representation, which can be translated into tractable and relatively simple fragments of classical logic. In this context, we show that refinements of resolution can often be used successfully for automated theorem proving, and in many interesting cases yield optimal decision procedures. 1
Automated Theorem Proving For Special Functions: The Next Phase
"... [Symbolic and algebraic manipulation]: Symbolic and algebraic algorithms—Theorem proving algorithms; [Theory of computation]: Logic—Logic and verification General Terms theorem proving, verification, decision procedures 1. RESOLUTION THEOREM PROVING Automated theorem proving, in a nutshell, is the c ..."
Abstract
 Add to MetaCart
[Symbolic and algebraic manipulation]: Symbolic and algebraic algorithms—Theorem proving algorithms; [Theory of computation]: Logic—Logic and verification General Terms theorem proving, verification, decision procedures 1. RESOLUTION THEOREM PROVING Automated theorem proving, in a nutshell
Progress in automated theorem proving, 19972001
 In Workshop on Empirical Methods in Artificial Intelligence, 17th International Joint Conference on Artificial Intelligence
, 2001
"... Abstract. Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First, for the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First
Results 11  20
of
29,331