Sciweavers

1144 search results - page 117 / 229
» Logic programming for combinatorial problems
Sort
View
ICLP
2005
Springer
15 years 8 months ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
138
Voted
DAWAK
2000
Springer
15 years 7 months ago
Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...
Matteo Golfarelli, Dario Maio, Stefano Rizzi
121
Voted
RECSYS
2009
ACM
15 years 9 months ago
Uncovering functional dependencies in MDD-compiled product catalogues
A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of ...
Tarik Hadzic, Barry O'Sullivan
PPDP
2009
Springer
15 years 9 months ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi
216
Voted
CP
2009
Springer
16 years 3 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...