When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Abstract. This paper analyzes the aggregation of different abstract attack relations over a common set of arguments. Each of those attack relations can be considered as the represe...
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
We developed new interactive display system called the palm display. Our prototype system shows the image of graphical user interface on the palm and allows the user to have intera...
We propose new interaction techniques named "One-finger Interaction" in the ubiquitous environment in a home. One-finger Interaction is an interaction technique for doing...
Recently, software size becomes larger, and consequently, not only a software developer but also a software purchaser suffers considerable losses by software project failure. So av...