632 search results - page 5 / 127 » Combining programming with theorem proving |
IGPL
1998
14 years 11 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
111
click to vote
CADE
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
105
Voted
IJCAI
2003
15 years 1 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
101
click to vote
JAR
2000
14 years 11 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
110
click to vote
FASE
2000
Springer
15 years 3 months ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...