1302 search results - page 186 / 261 » Free-Style Theorem Proving |
140
click to vote
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
138
click to vote
TYPES
2000
Springer
15 years 7 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
160
Voted
TABLEAUX
1995
Springer
15 years 7 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...
156
click to vote
AAAI
2008
15 years 6 months ago
2008
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
128
click to vote
AMAST
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...