2911 search results - page 190 / 583 » A Logic of Graph Constraints |
200
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
250
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
220
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
182
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
188
click to vote
CISSE
2008
Springer
15 years 8 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...