Sciweavers

2519 search results - page 220 / 504
» Reasoning with Textual Cases
Sort
View
CADE
2008
Springer
16 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
CADE
2007
Springer
16 years 7 months ago
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
Samuli Heilala, Brigitte Pientka
CADE
2006
Springer
16 years 7 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
CADE
2004
Springer
16 years 7 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
ICCBR
2009
Springer
16 years 1 months ago
Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions
In this paper we revisit the trade-off between adaptation and retrieval effort traditionally held as a principle in case-based reasoning. This principle states that the time needed...
Stephen Lee-Urban, Héctor Muñoz-Avil...