2845 search results - page 159 / 569 » Constraints over Ontologies |
144
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
171
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
151
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
149
click to vote
AIPS
2009
15 years 7 months ago
2009
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
169
click to vote
EAAI
2008
15 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...