56 search results - page 5 / 12 » Efficient Reasoning with Range and Domain Constraints |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
AAAI
2006
13 years 9 months ago
2006
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
AMAI
1999
Springer
13 years 7 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...