| 2008 |
|---|
| 16 | | Viet Phan Luong:
Suppression des Itemsets Clés Non-Essentiels en Classification basée sur les Règles d’Association.
EGC 2008: 385-396 |
| 2003 |
|---|
| 15 | EE | Viet Phan Luong,
T. T. Pham,
Robert Jeansoulin:
Integrating Information under Lattice Structure.
ISMIS 2003: 83-87 |
| 14 | EE | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
Querying Weak Instances Under Extension Chase Semantics: A Complete Solution.
Int. J. Comput. Math. 80(5): 591-613 (2003) |
| 2002 |
|---|
| 13 | | Viet Phan Luong:
A Method for Computing Frequent Key and Closed Itemsets in One Phase.
BDA 2002 |
| 12 | EE | Viet Phan Luong:
The Closed Keys Base of Frequent Itemsets.
DaWaK 2002: 181-190 |
| 2001 |
|---|
| 11 | | Viet Phan Luong:
Reasoning on Association Rules.
BDA 2001 |
| 10 | EE | Viet Phan Luong:
The Representative Basis for Association Rules.
ICDM 2001: 639-640 |
| 1999 |
|---|
| 9 | EE | Viet Phan Luong:
Between Well-Founded Semantics and Stable Model Semantics.
IDEAS 1999: 270-278 |
| 1998 |
|---|
| 8 | EE | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
Updating Intensional Predicates in Deductive Databases.
Data Knowl. Eng. 26(1): 37-70 (1998) |
| 1997 |
|---|
| 7 | | Viet Phan Luong:
Computing stable models of datalog programs with negation.
JFPLC 1997: 101- |
| 6 | EE | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
The Use of Deleted Tuples in Database, Querying and Updating.
Acta Inf. 34(12): 905-925 (1997) |
| 1995 |
|---|
| 5 | | Viet Phan Luong:
A Mixed Approach to Negation in General Datalog Programs.
DOOD 1995: 378-394 |
| 4 | | Viet Phan Luong:
A mixed approach to negation in general datalog programs.
JFPLC 1995: 207-220 |
| 1993 |
|---|
| 3 | | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
Database Updating Revisited.
DOOD 1993: 296-309 |
| 2 | EE | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
Updating Intensional Predicates in Deductive Databases.
ICDE 1993: 14-21 |
| 1992 |
|---|
| 1 | EE | Dominique Laurent,
Viet Phan Luong,
Nicolas Spyratos:
Deleted Tuples are Useful when Updating through Universal Scheme Interfaces.
ICDE 1992: 420-427 |
