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

]