4513 search results - page 513 / 903 » Logic programming with satisfiability |
140
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
147
click to vote
PEPM
2009
ACM
15 years 9 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
138
click to vote
ICALP
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
152
click to vote
TCS
2010
15 years 3 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
150
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...