25 search results - page 5 / 5 » Bridging Theorem Proving and Mathematical Knowledge Retrieva... |
TYPES
1998
Springer
13 years 10 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
STACS
1993
Springer
13 years 10 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
ARGMAS
2007
Springer
13 years 10 months ago
2007
Springer
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...