4513 search results - page 620 / 903 » Logic programming with satisfiability |
191
click to vote
CALCO
2005
Springer
16 years 1 days ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
151
click to vote
CC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
160
click to vote
ASPDAC
2004
ACM
15 years 12 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
146
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
172
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...