35 search results - page 4 / 7 » Path Constraints from a Modal Logic Point of View |
140
Voted
INAP
2001
Springer
15 years 9 months ago
2001
Springer
Universidade de ´Evora’s Integrated Information System (SIIUE) aims at representing the entire universe of concepts useful for the management and day-to-day operation of the Or...
293
click to vote
ISMIS
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
178
click to vote
LICS
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
197
click to vote
AMAI
1999
Springer
15 years 5 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...
156
click to vote
ICTAI
2009
IEEE
15 years 3 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...