241 search results - page 34 / 49 » Bounded Nondeterminism of Logic Programs |
IOR
2007
13 years 7 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
JACM
2010
13 years 6 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...