Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Dino Pedreschi

Papers on DiSC'04


ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraint

Publications


Note: Links lead to the DBLP on the Web.

Dino Pedreschi

Francesco Bonchi , Fosca Giannotti , Alessio Mazzanti , Dino Pedreschi: ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraint. ICDM 2003 : 11-18

Francesco Bonchi , Fosca Giannotti , Alessio Mazzanti , Dino Pedreschi: Adaptive Constraint Pushing in Frequent Pattern Mining. PKDD 2003 : 47-58

Francesco Bonchi , Fosca Giannotti , Alessio Mazzanti , Dino Pedreschi: ExAnte: Anticipated Data Reduction in Constrained Pattern Mining. PKDD 2003 : 59-70

Fosca Giannotti , Mirco Nanni , Dino Pedreschi, F. Samaritani : WebCat: Automatic Categorization of Web Search Results. SEBD 2003 : 507-518

Francesco Bonchi , Fosca Giannotti , Alessio Mazzanti , Dino Pedreschi: Pre-processing for Constrained Pattern Mining. SEBD 2003 : 519-530

Dino Pedreschi, Salvatore Ruggieri : On logic programs that always succeed. Sci. Comput. Program. 48 (2-3): 163-196 (2003)

Paolo Mancarella , Dino Pedreschi, Salvatore Ruggieri : Negation as Failure through Abduction: Reasoning about Termination. Computational Logic: Logic Programming and Beyond 2002 : 240-272

Paolo Mascellani , Dino Pedreschi: The Declarative Side of Magic. Computational Logic: Logic Programming and Beyond 2002 : 83-108

Dino Pedreschi, Salvatore Ruggieri , Jan-Georg Smaus : Classes of terminating logic programs. TPLP 2 (3): 369-418 (2002)

Francesco Bonchi , Fosca Giannotti , Giuseppe Manco , Chiara Renso , Mirco Nanni , Dino Pedreschi, Salvatore Ruggieri : Data Mining for Intelligent Web Caching. ITCC 2001 : 599-603

Francesco Bonchi , Fosca Giannotti , Cristian Gozzi , Giuseppe Manco , Mirco Nanni , Dino Pedreschi, Chiara Renso , Salvatore Ruggieri : Web log data warehousing and mining for intelligent web caching. Data Knowl. Eng. 39 (2): 165-189 (2001)

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi: Nondeterministic, Nonmonotonic Logic Databases. IEEE Trans. Knowl. Data Eng. 13 (5): 813-823 (2001)

Fosca Giannotti , Dino Pedreschi, Carlo Zaniolo : Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases. J. Comput. Syst. Sci. 62 (1): 15-42 (2001)

Francesco Bonchi , Fosca Giannotti , Dino Pedreschi: On Verification in Logic Database Languages. Computational Logic 2000 : 957-971

Fosca Giannotti , Mirco Nanni , Dino Pedreschi: Logic-Based Knowledge Discovery in Databases. EJC 2000 : 279-283

Marat Fayzullin , Mirco Nanni , Dino Pedreschi, V. S. Subrahmanian : Foundations of distributed interaction systems. Ann. Math. Artif. Intell. 28 (1-4): 127-168 (2000)

Fosca Giannotti , Giuseppe Manco , Dino Pedreschi, Franco Turini : Experiences with a Logic-based knowledge discovery Support Environment. 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999

Fosca Giannotti , Giuseppe Manco , Dino Pedreschi, Franco Turini : Experiences with a Logic-Based Knowledge Discovery Support Environment. AI*IA 1999 : 202-213

Francesco Bonchi , Fosca Giannotti , Gianni Mainetto , Dino Pedreschi: Using Data Mining Techniques in Fiscal Fraud Detection. DaWaK 1999 : 369-376

Dino Pedreschi, Salvatore Ruggieri : Bounded Nondeterminism of Logic Programs. ICLP 1999 : 350-364

Francesco Bonchi , Fosca Giannotti , Gianni Mainetto , Dino Pedreschi: A Classification-Based Methodology for Planning Audit Strategies in Fraud Detection. KDD 1999 : 175-184

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi, Franco Turini : Integration of Deduction and Induction for Mining Supermarket Sales Data. SEBD 1999 : 117-131

Francesco Bonchi , Fosca Giannotti , Gianni Mainetto , Dino Pedreschi: Una Metodologia Basata sulla Classificazione per la Pianificazione degli Accertamenti nel Rilevamento di Frodi. SEBD 1999 : 69-84

Dino Pedreschi, Salvatore Ruggieri : On Logic Programs That Do Not Fail. Electr. Notes Theor. Comput. Sci. 30 (1): (1999)

Dino Pedreschi, Salvatore Ruggieri : Verification of Logic Programs. J. Log. Program. 39 (1-3): 125-176 (1999)

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi: On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases. CSL 1998 : 58-72

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi: Query Answering in Nondeterministic, Nonmonotonic Logic Databases. FQAS 1998 : 175-187

Dino Pedreschi, Salvatore Ruggieri : Weakest Preconditions for Pure Prolog Programs. Inf. Process. Lett. 67 (3): 145-150 (1998)

Fosca Giannotti , Dino Pedreschi: Datalog with Non-Deterministic Choice Computers NDB-PTIME. J. Log. Program. 35 (1): 79-101 (1998)

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi: Datalog++: A Basis for Active Object-Oriented Databases. DOOD 1997 : 283-301

Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi: Datalog++: a Basis for Active Object.Oriented Databases. SEBD 1997 : 325-340

Dino Pedreschi, V. S. Subrahmanian : Non-determinism in Deductive Databases - Preface. Ann. Math. Artif. Intell. 19 (1-2): 1-2 (1997)

Dino Pedreschi, Salvatore Ruggieri : Verification of Meta-Interpreters. J. Log. Comput. 7 (2): 267-303 (1997)

Dino Pedreschi, Carlo Zaniolo : Logic in Databases, International Workshop LID'96, San Miniato, Italy, July 1-2, 1996, Proceedings Springer 1996

Krzysztof R. Apt , Maurizio Gabbrielli , Dino Pedreschi: A Closer Look at Declarative Interpretations. J. Log. Program. 28 (2): 147-180 (1996)

Marilisa E. Carboni , Fosca Giannotti , V. Foddai , Dino Pedreschi: Declarative Reconstruction of Updates in Logic Databases: A Compilative Approach. SEBD 1995 : 3-13

Dino Pedreschi: A Proof Method for Runtime Properties of Prolog Programs. ICLP 1994 : 584-598

Antonio Brogi , A. Chiarelli , Paolo Mancarella , V. Mazzotta , Dino Pedreschi, Chiara Renso , Franco Turini : Implementations of Program Composition Operations. PLILP 1994 : 292-307

Luca Corciulo , Fosca Giannotti , Dino Pedreschi, Carlo Zaniolo : Expressive Power of Non-Deterministic Operators for Logic-based Languages. Workshop on Deductive Databases and Logic Programming 1994 : 27-40

Antonio Brogi , Paolo Mancarella , Dino Pedreschi, Franco Turini : Modular Logic Programming. ACM Trans. Program. Lang. Syst. 16 (4): 1361-1398 (1994)

Luca Corciulo , Fosca Giannotti , Dino Pedreschi: Datalog with Non-Deterministic Choice Computes NDB-PTIME. DOOD 1993 : 49-66

Krzysztof R. Apt , Dino Pedreschi: Reasoning about Termination of Pure Prolog Programs Inf. Comput. 106 (1): 109-157 (1993)

Antonio Brogi , Paolo Mancarella , Dino Pedreschi, Franco Turini : Meta for Modularising Logic Programming. META 1992 : 105-119

Bruno Bertolino , Luigi Meo , Dino Pedreschi, Franco Turini : The Type System of LML. Types in Logic Programming 1992 : 313-332

Fosca Giannotti , Dino Pedreschi, Domenico Saccà , Carlo Zaniolo : Non-Determinism in Deductive Databases. DOOD 1991 : 129-146

Antonio Brogi , Paolo Mancarella , Dino Pedreschi, Franco Turini : Theory Construction in Computational Logic. ICLP Workshop on Construction of Logic Programs 1991 : 241-250

Krzysztof R. Apt , Dino Pedreschi: Proving Termination of General Prolog Programs. TACS 1991 : 265-289

Antonio Brogi , Paolo Mancarella , Dino Pedreschi, Franco Turini : Universal Quantification by Case Analysis. ECAI 1990 : 111-116

Fosca Giannotti , Dino Pedreschi: Declarative Semantics for Pruning Operators in Logic Programming. LPNMR 1990 : 27-37

Paolo Mancarella , Dino Pedreschi, Marina Rondinelli , Marco Tagliatti : Algebraic Properties of a Class of Logic Programs. NACLP 1990 : 23-39

Antonio Brogi , Paolo Mancarella , Dino Pedreschi, Franco Turini : Logic Programming within a Functional Framework. PLILP 1990 : 372-386

Roberto Barbuti , Paolo Mancarella , Dino Pedreschi, Franco Turini : A Transformational Approach to Negation in Logic Programming. J. Log. Program. 8 (3): 201-228 (1990)

Bruno Bertolino , Paolo Mancarella , Luigi Meo , Luca Nini , Dino Pedreschi, Franco Turini : A Progress Report on the LML Project. FGCS 1988 : 675-684

Paolo Mancarella , Dino Pedreschi: An Algebra of Logic Programs. ICLP/SLP 1988 : 1006-1023

Paolo Mancarella , Simone Martini , Dino Pedreschi: Complete Logic Programs with Domain-Closure Axiom. J. Log. Program. 5 (3): 263-276 (1988)

Roberto Barbuti , Paolo Mancarella , Dino Pedreschi, Franco Turini : Intensional Negation of Logic Programs: Examples and Implementation Techniques. TAPSOFT, Vol.2 1987 : 96-110

Fosca Giannotti , Attilio Matteucci , Dino Pedreschi, Franco Turini : Symbolic Evaluation with Structural Recursive Symbolic Constants. Sci. Comput. Program. 9 (2): 161-177 (1987)

Antonio Albano , Fosca Giannotti , Renzo Orsini , Dino Pedreschi: The Type System of Galileo. Data Types and Persistence (Appin) 1985 : 101-119

Antonio Albano , Fosca Giannotti , Renzo Orsini , Dino Pedreschi: The Type System of Galileo. Data Types and Persistence (Appin), Informal Proceedings 1985 : 175-195

Vincenzo Ambriola , Fosca Giannotti , Dino Pedreschi, Franco Turini : Symbolic Semantics and Program Reduction. IEEE Trans. Software Eng. 11 (8): 784-794 (1985)

1 [ 2 ] [ 3 ]

2 [ 1 ]

3 [ 14 ] [ 19 ] [ 26 ]

4 [ 5 ] [ 9 ]

5 [ 8 ] [ 17 ]

6 [ 38 ] [ 40 ] [ 42 ] [ 47 ] [ 50 ] [ 51 ] [ 56 ] [ 58 ] [ 59 ] [ 60 ]

7 [ 10 ] [ 13 ] [ 15 ] [ 18 ] [ 21 ] [ 23 ]

8 [ 25 ]

9 [ 23 ]

10 [ 20 ] [ 22 ]

11 [ 45 ]

12 [ 25 ]

13 [ 26 ]

14 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 12 ] [ 16 ] [ 20 ] [ 22 ] [ 25 ] [ 30 ] [ 31 ] [ 32 ] [ 34 ] [ 35 ] [ 38 ] [ 39 ] [ 40 ] [ 42 ] [ 43 ] [ 44 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 51 ] [ 56 ] [ 57 ] [ 58 ] [ 59 ] [ 60 ]

15 [ 50 ]

16 [ 38 ] [ 40 ] [ 42 ]

17 [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 15 ] [ 18 ] [ 21 ] [ 23 ] [ 54 ]

18 [ 30 ] [ 31 ] [ 34 ] [ 35 ] [ 39 ] [ 43 ] [ 44 ] [ 49 ] [ 50 ] [ 51 ]

19 [ 6 ]

20 [ 53 ]

21 [ 4 ]

22 [ 56 ] [ 58 ] [ 59 ] [ 60 ]

23 [ 23 ]

24 [ 8 ] [ 17 ]

25 [ 30 ] [ 31 ] [ 34 ] [ 35 ] [ 39 ] [ 45 ] [ 46 ] [ 49 ] [ 50 ] [ 51 ] [ 57 ]

26 [ 8 ]

27 [ 2 ] [ 3 ]

28 [ 23 ] [ 50 ] [ 51 ]

29 [ 11 ]

30 [ 28 ] [ 33 ] [ 36 ] [ 37 ] [ 41 ] [ 50 ] [ 51 ] [ 52 ] [ 54 ] [ 55 ]

31 [ 16 ]

32 [ 57 ]

33 [ 52 ]

34 [ 29 ] [ 45 ]

35 [ 11 ]

36 [ 1 ] [ 4 ] [ 5 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 15 ] [ 17 ] [ 18 ] [ 21 ] [ 23 ] [ 39 ] [ 43 ] [ 44 ]

37 [ 16 ] [ 22 ] [ 27 ] [ 48 ]




©2004 Association for Computing Machinery