Publications

Export 22 results:
Sort by: Author Title [ Type (Asc)] Year
Conference Paper
Pedreschi, D, Ruggieri S.  1999.  Bounded Nondeterminism of Logic Programs. ICLP. :350-364.
Pedreschi, D, Ruggieri S.  1995.  A Case Study in Logic Program Verification: the Vanilla Metainterpreter. GULP-PRODE. :643-654.
Grossi, V, Romei A, Ruggieri S.  2008.  A Case Study in Sequential Pattern Mining for IT-Operational Risk. ECML/PKDD (1). :424-439.
Pedreschi, D, Ruggieri S, Smaus J-G.  2004.  Characterisations of Termination in Logic Programming. Program Development in Computational Logic. :376-431.
Bonchi, F, Giannotti F, Manco G, Renso C, Nanni M, Pedreschi D, Ruggieri S.  2001.  Data Mining for Intelligent Web Caching. ITCC. :599-603.
Bonchi, F, Giannotti F, Manco G, Renso C, Nanni M, Pedreschi D, Ruggieri S.  2001.  Data Mining for Intelligent Web Caching. ITCC. :599-603.
Pedreschi, D, Ruggieri S, Turini F.  2008.  Discrimination-aware data mining. KDD. :560-568.
Pedreschi, D, Ruggieri S, Turini F.  2009.  Integrating induction and deduction for finding evidence of discrimination. ICAIL. :157-166.
Pedreschi, D, Ruggieri S, Turini F.  2009.  Measuring Discrimination in Socially-Sensitive Decision Records. SDM. :581-592.
Mancarella, P, Pedreschi D, Ruggieri S.  2002.  Negation as Failure through Abduction: Reasoning about Termination. Computational Logic: Logic Programming and Beyond. :240-272.
Ruggieri, S, Mesnard F.  2008.  Typing Linear Constraints for Moding CLP() Programs. SAS. :128-143.
Rinzivillo, S, Ruggieri S.  2011.  Who/Where Are My New Customers? ISMIS Industrial Session. :307-317.
Journal Article
Pedreschi, D, Ruggieri S.  2004.  Bounded Nondeterminism of Logic Programs. Ann. Math. Artif. Intell.. 42:313-343.
Pedreschi, D, Ruggieri S, Smaus J-G.  2001.  Classes of Terminating Logic Programs. CoRR. cs.LO/0106
Pedreschi, D, Ruggieri S, Smaus J-G.  2002.  Classes of terminating logic programs. TPLP. 2:369-418.
Pedreschi, D, Ruggieri S.  2003.  On logic programs that always succeed. Sci. Comput. Program.. 48:163-196.
Pedreschi, D, Ruggieri S.  1999.  On Logic Programs That Do Not Fail. Electr. Notes Theor. Comput. Sci.. 30
Pedreschi, D, Ruggieri S.  1999.  Verification of Logic Programs. J. Log. Program.. 39:125-176.
Pedreschi, D, Ruggieri S.  1997.  Verification of Meta-Interpreters. J. Log. Comput.. 7:267-303.
Pedreschi, D, Ruggieri S.  1998.  Weakest Preconditions for Pure Prolog Programs. Inf. Process. Lett.. 67:145-150.
Bonchi, F, Giannotti F, Gozzi C, Manco G, Nanni M, Pedreschi D, Renso C, Ruggieri S.  2001.  Web log data warehousing and mining for intelligent web caching. Data Knowl. Eng.. 39:165-189.
Bonchi, F, Giannotti F, Gozzi C, Manco G, Nanni M, Pedreschi D, Renso C, Ruggieri S.  2001.  Web log data warehousing and mining for intelligent web caching. Data Knowl. Eng.. 39:165-189.