Results 11  20
of
795
Logic: II Theorem Proving and
"... Abduction Is a basic form of logical inference, which is said to engender the use of plans, perceptual models, intuitions, and analogical reasoningall aspects of Intelligent behavior that have so far failed to find representation in existing formal deductive systems. This paper explores the abducti ..."
Abstract
 Add to MetaCart
Abduction Is a basic form of logical inference, which is said to engender the use of plans, perceptual models, intuitions, and analogical reasoningall aspects of Intelligent behavior that have so far failed to find representation in existing formal deductive systems. This paper explores
An Open Approach to Concurrent TheoremProving
 Parallel Processing for Artificial Intelligence
, 1997
"... The purpose of this paper is twofold. Its main aim is to present an alternative mechanism for representing concurrent theoremproving activity which primarily relies upon massive parallelism and efficient broadcast communication. A secondary aim is to further motivate this model of concurrent theore ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
The purpose of this paper is twofold. Its main aim is to present an alternative mechanism for representing concurrent theoremproving activity which primarily relies upon massive parallelism and efficient broadcast communication. A secondary aim is to further motivate this model of concurrent
Mechanical theorem proving in the local theory of surfaces
 Annals of Mathematics and Artificial Intelligence
, 1995
"... The present paper applies the characteristic set method of algebraic differential polynomials to give a mechanical procedure which permits us to prove nontrivial theorems in the local theory of surfaces. By this method, we have discovered a new relation between the first and second fundamental form ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
on the works of Riquier, Janet, Cartan, Thomas and Ritt. One of the applications of this method is mechanical theoremproving (abbreviated as MTP) in differential geometries. In the case of a single independent variable, this method is quite similar to the charset method in the algebraic case. There have been
User Interface Design for Mechanized Theorem Proving
"... c disciplinenamely, the study of HumanComputer Interaction. The interface designers are often primarily theoremproving or formal methods experts; they seldom have extensive training in the principles of HumanComputer Interaction (HCI) as well. Their interfaces are therefore not designed with ..."
Abstract
 Add to MetaCart
c disciplinenamely, the study of HumanComputer Interaction. The interface designers are often primarily theoremproving or formal methods experts; they seldom have extensive training in the principles of HumanComputer Interaction (HCI) as well. Their interfaces are therefore not designed
The Applications of Theorem Proving to QuestionAnswering Systems
, 1969
"... This paper shows how a questionanswering system can use firstorder logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
This paper shows how a questionanswering system can use firstorder logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction
Proving theorems about Java and the JVM with ACL2
 Models, Algebras and Logic of Engineering Software
, 2003
"... We describe a methodology for proving theorems mechanically about Java methods. The theorem prover used is the ACL2 system, an industrialstrength version of the BoyerMoore theorem prover. An operational semantics for a substantial subset of the Java Virtual Machine (JVM) has been defined in ACL2. ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
We describe a methodology for proving theorems mechanically about Java methods. The theorem prover used is the ACL2 system, an industrialstrength version of the BoyerMoore theorem prover. An operational semantics for a substantial subset of the Java Virtual Machine (JVM) has been defined in ACL2
A Maple Package for Automatic Theorem Proving and Discovery in 3DGeometry
"... Abstract. A package for investigating problems about configuration theorems in 3Dgeometry and performing mechanical theorem proving and discovery is presented. It includes the preparation of the problem, consisting of three processes: defining the geometric objects in the configuration; determining ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. A package for investigating problems about configuration theorems in 3Dgeometry and performing mechanical theorem proving and discovery is presented. It includes the preparation of the problem, consisting of three processes: defining the geometric objects in the configuration
THE REGULARITY THEOREM IN ALGEBRAIC GEOMETRY
"... A basic finiteness theorem for families of algebraic varieties is that the PicardFuchs differential equations have only regular (in the sense of Fuchs) singular points. The theorem was proved analytically by P. A. Griffiths [3], then by P. Deligne, both of whom used Hironaka's resolution of si ..."
Abstract
 Add to MetaCart
A basic finiteness theorem for families of algebraic varieties is that the PicardFuchs differential equations have only regular (in the sense of Fuchs) singular points. The theorem was proved analytically by P. A. Griffiths [3], then by P. Deligne, both of whom used Hironaka's resolution
DEDUCTION AND PROVING OF GEOMETRIC STATEMENTS IN INTERACTIVE GEOMETRY ENVIRONMENT
, 2010
"... Abstract. Synthetic geometry has been making a comeback to university education, thanks to modern applications of geometry software tools. In this paper we look at an application of automated theorem proving (ATP) in the verification of constructions made with interactive geometry environment. In a ..."
Abstract
 Add to MetaCart
Abstract. Synthetic geometry has been making a comeback to university education, thanks to modern applications of geometry software tools. In this paper we look at an application of automated theorem proving (ATP) in the verification of constructions made with interactive geometry environment
Combining higher order abstract syntax with tactical theorem proving and (co)induction
 In TPHOLs ’02: Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
, 2002
"... Abstract. Combining Higher Order Abstract Syntax (HOAS) and induction is well known to be problematic. We have implemented a tool called Hybrid, within Isabelle HOL, which does allow object logics to be represented using HOAS, and reasoned about using tactical theorem proving in general and principl ..."
Abstract

Cited by 38 (16 self)
 Add to MetaCart
Abstract. Combining Higher Order Abstract Syntax (HOAS) and induction is well known to be problematic. We have implemented a tool called Hybrid, within Isabelle HOL, which does allow object logics to be represented using HOAS, and reasoned about using tactical theorem proving in general
Results 11  20
of
795