Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
Reinhard Pichler, Axel Polleres, Fang Wei, Stefan ...
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...