2962 search results - page 249 / 593 » Reasoning on Association Rules |
172
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, belief functions, defined on the lattice of partitions of a set of objects, are investigated as a suitable framework for combining multiple clusterings. W...
187
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
179
click to vote
LOPSTR
2007
Springer
16 years 24 days ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
174
click to vote
NMR
2004
Springer
16 years 19 hour ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
162
click to vote
OOPSLA
2004
Springer
16 years 18 hour ago
2004
Springer
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...