204 search results - page 30 / 41 » A Connection Based Proof Method for Intuitionistic Logic |
UTP
2010
13 years 6 months ago
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
COR
2006
13 years 7 months ago
2006
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
SAS
1993
Springer
13 years 11 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
FM
2008
Springer
13 years 9 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....