Abstract. We propose a formal definition of the robustness of association rules for interestingness measures. It is a central concept in the evaluation of the rules and has only be...
Yannick Le Bras, Patrick Meyer, Philippe Lenca, St...
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
: This paper reveals the evolution of the polymorphic architectures in the context of ever increasing computational demands of the user applications and the need for formal archite...
Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communit...
A particularly challenging task for recommender systems (RSs) is deciding whether to recommend an item that received a variety of high and low scores from its users. RSs that inco...
Patricia Victor, Chris Cornelis, Martine De Cock, ...