4513 search results - page 419 / 903 » Logic programming with satisfiability |
150
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
160
Voted
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
In an open system, multi-agent computations must compete for resources required for satisfying their goals. We describe CyberOrgs, a hierarchical model for acquisition and control...
163
Voted
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
128
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
159
click to vote
EUROCAST
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...