Results 1  10
of
184,266
Extending Automatic Theorem Proving By Planning
, 1993
"... A general concept for combining planning with automatic theorem proving is introduced. From this a system architecture based on the notion of planning trees, methods and sensors is developed. It is illustrated by examples taken from the domain of sorting algorithms. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A general concept for combining planning with automatic theorem proving is introduced. From this a system architecture based on the notion of planning trees, methods and sensors is developed. It is illustrated by examples taken from the domain of sorting algorithms.
The Practice of Clausification in Automatic Theorem Proving
, 1996
"... In the process of resolution based Automatic Theorem Proving, problems expressed in First Order Form (FOF) are transformed by a clausifier to Clause NormalForm (CNF). This research examines and compares clausifiers. The boundaries between clausification, simplification, and solution search are delin ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In the process of resolution based Automatic Theorem Proving, problems expressed in First Order Form (FOF) are transformed by a clausifier to Clause NormalForm (CNF). This research examines and compares clausifiers. The boundaries between clausification, simplification, and solution search
Zapato: Automatic theorem proving for
, 2004
"... Counterexampledriven abstraction refinement is an automatic process that produces abstract models of finite and infinitestate systems. When this process is applied to software, an automatic theorem prover for quantifierfree firstorder logic helps to determine the feasibility of program paths ..."
Abstract
 Add to MetaCart
Counterexampledriven abstraction refinement is an automatic process that produces abstract models of finite and infinitestate systems. When this process is applied to software, an automatic theorem prover for quantifierfree firstorder logic helps to determine the feasibility of program
Keywords and phrases: Automatic theorem proving,
"... clause interconnectivity graphs, contextfree grammars, attribute grammars, proof theory. This work supported in part by the Office of Naval Research under contract 76C0681. Contextfree attribute grammars are proposed as derivational models for proofs in the predicate calculus. The new representa ..."
Abstract
 Add to MetaCart
the restrictions imposed by the required unifications. While previous theorem proving methods have been able to enumerate all proofs of a theorem, the method reported here is unique in being able to characterize all proofs of some theorems, representing even an infinite set of proofs with a finite formula
The Practice of Clausification in Automatic Theorem Proving Page 1
"... problems expressed in First Order Form (FOF) are transformed by a clausifier to Clause Normal Form (CNF). This research examines and compares clausifiers. The boundaries between clausification, simplification, and solution search are delineated, and common clausification and simplification operation ..."
Abstract
 Add to MetaCart
operations are documented. Four known clausifiers are evaluated, thus providing insight into their relative performance, and also providing baseline data for future evaluation of clausifiers. Automatic Theorem Proving (ATP) is the study and development of computer programs that build proofs of theorems
An Application of Automatic Theorem Proving in Computer Vision
 IN AUTOMATED DEDUCTION IN GEOMETRY
, 1998
"... Getting accurate construction of tridimensional CAD models is a field of great importance: with the increasing complexity of the models that modeling tools can manage nowadays, it becomes more and more necessary to construct geometrically accurate descriptions. Maybe the most promising technique, ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
, because of its full generality, is the use of automatic geometric tools: these can be used for checking the geometrical coherency and discovering geometrical properties of the model. In this paper, we describe an automatic method for constructing the model of a given geometrical configuration
A Note on Irreducible Decomposition of Algebraic Sets and Automatic Theorem Proving
, 1996
"... In this paper, we present some new results concerning the dimension of the irreducible components of an algebraic set. We also point out that our results are very useful in Computer Aided Geometric Design (CAGD) and Visualization, in particular when the algebraic set is onedimensional. In the secon ..."
Abstract
 Add to MetaCart
dimensional. In the second part of the paper, we report our experiments on combining results in Automatic Theorem Proving with the computer algebra system CASA  a computer algebra system for Algebraic Geometry. Keywords: Irreducible decomposition, Automatic Theorem Proving . 1 Introduction Irreducible decomposition
A new approach for automatic theorem proving in real geometry
 Journal of Automated Reasoning
, 1998
"... Abstract. We present a new method for proving geometric theorems in the real plane or higher dimension. The method is derived from elimination set ideas for quantifier elimination in linear and quadratic formulas over the reals. In contrast to other approaches, our method can also prove theorems who ..."
Abstract

Cited by 38 (17 self)
 Add to MetaCart
in the claimed generality, missing premises are found automatically. We demonstrate the applicability of our method to nontrivial examples. Key words: real quantifier elimination, real geometry, automatic theorem proving over the reals. 1.
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
 In National Conference on Artificial Intelligence (AAAI
, 2000
"... The game of ilex is a twoplayer game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive gametree search techniques developed mostly for Chess, and successfully used for Checkers, Othello, and a number of other g ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
games, become less useful for games with large branching factors like Go and Hex. We offer a new approach, which results in superior playing strength. This approach emphasizes deep analysis of relatively few game positions. In order to reach this goal, we develop an automatic theorem proving
Results 1  10
of
184,266