64 search results - page 4 / 13 » Critical Agents Supporting Interactive Theorem Proving |
APSEC
2005
IEEE
14 years 1 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
24
Voted
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
CLIMA
2004
13 years 8 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
AI
2007
Springer
13 years 7 months ago
2007
Springer
The AGM postulates for belief revision, augmented by the DP postulates for iterated belief revision, provide generally accepted criteria for the design of operators by which intel...