1743 search results - page 108 / 349 » Generalized Modal Satisfiability |
ACTA
2004
15 years 21 days ago
2004
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
100
click to vote
DAC
2005
ACM
16 years 1 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
223
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
105
Voted
APN
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we complete the semantical framework proposed in [12] for process and causality semantics of Petri nets by an additional aim and develop process and causality semanti...
104
Voted
CPAIOR
2006
Springer
15 years 2 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...