
Publications
.
2004. Bounded Nondeterminism of Logic Programs. Ann. Math. Artif. Intell.. 42:313-343.
.
1996. Logic in Databases, International Workshop LID'96, San Miniato, Italy, July 1-2, 1996, Proceedings. Lecture Notes in Computer Science. 1154
.
2009. Measuring Discrimination in Socially-Sensitive Decision Records. SDM. :581-592.
.
2001. Classes of Terminating Logic Programs. CoRR. cs.LO/0106
.
1999. Verification of Logic Programs. J. Log. Program.. 39:125-176.
.
2004. Characterisations of Termination in Logic Programming. Program Development in Computational Logic. :376-431.
.
1997. Verification of Meta-Interpreters. J. Log. Comput.. 7:267-303.
.
2008. Discrimination-aware data mining. KDD. :560-568.
.
2002. Classes of terminating logic programs. TPLP. 2:369-418.
.
1994. A Proof Method for Runtime Properties of Prolog Programs. ICLP. :584-598.
.
1999. On Logic Programs That Do Not Fail. Electr. Notes Theor. Comput. Sci.. 30
.
1997. Non-determinism in Deductive Databases - Preface. Ann. Math. Artif. Intell.. 19:1-2.
.
2008. Privacy Protection: Regulations and Technologies, Opportunities and Threats. Mobility, Data Mining and Privacy. :101-119.
.
2003. On logic programs that always succeed. Sci. Comput. Program.. 48:163-196.
.
1995. A Case Study in Logic Program Verification: the Vanilla Metainterpreter. GULP-PRODE. :643-654.
.
2009. Integrating induction and deduction for finding evidence of discrimination. ICAIL. :157-166.
.
1999. Bounded Nondeterminism of Logic Programs. ICLP. :350-364.
.
1998. Weakest Preconditions for Pure Prolog Programs. Inf. Process. Lett.. 67:145-150.
.
2009. Anonymous Sequences from Trajectory Data. 17th Italian Symposium on Advanced Database Systems.
.
2008. Location prediction within the mobility data analysis environment Daedalus. First International Workshop on Computational Transportation Science.

]