4513 search results - page 414 / 903 » Logic programming with satisfiability |
122
click to vote
ICCBR
2009
Springer
15 years 11 months ago
2009
Springer
Integrity constraint belief merging aims at producing from several knowledge bases, that may be mutually inconsistent, a synthetic knowledge base satisfying a given integrity const...
125
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
121
click to vote
FUIN
2008
15 years 5 months ago
2008
Abstract. The layering that is present in many OO designs is not accounted for in current interpretations of invariants. We propose to make layers explicit in specifications and in...
159
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
124
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...