4513 search results - page 732 / 903 » Logic programming with satisfiability |
148
Voted
CASSIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
125
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
131
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
126
Voted
ICLP
2004
Springer
15 years 9 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
133
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...