536 search results - page 38 / 108 » A Translational Approach to Constraint Answer Set Solving |
115
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
129
click to vote
HIPC
2004
Springer
15 years 9 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
128
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
132
click to vote
FATES
2005
Springer
15 years 9 months ago
2005
Springer
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
140
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...