2410 search results - page 29 / 482 » Multiset Ordering Constraints |
150
click to vote
PAMI
2010
15 years 2 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
169
click to vote
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
145
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
244
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
130
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...