3658 search results - page 451 / 732 » The logic of proofs, semantically |
180
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
164
click to vote
ERSHOV
2001
Springer
15 years 11 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
191
click to vote
CADE
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
186
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
204
click to vote
TABLEAUX
1995
Springer
15 years 10 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...