Publications

You are here

Export 5 results:
[ Author(Asc)] Title Type Year
Filters: Author is Dino Pedreschi  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
P
D. Pedreschi, A Proof Method for Runtime Properties of Prolog Programs, in ICLP, 1994, pp. 584-598.
D. Pedreschi and Ruggieri, S., A Case Study in Logic Program Verification: the Vanilla Metainterpreter, in GULP-PRODE, 1995, pp. 643-654.
D. Pedreschi and Zaniolo, C., Logic in Databases, International Workshop LID'96, San Miniato, Italy, July 1-2, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1154. Springer, 1996.
D. Pedreschi and Ruggieri, S., Verification of Meta-Interpreters, J. Log. Comput., vol. 7, pp. 267-303, 1997.
D. Pedreschi and Subrahmanian, V. S., Non-determinism in Deductive Databases - Preface, Ann. Math. Artif. Intell., vol. 19, pp. 1-2, 1997.
D. Pedreschi and Ruggieri, S., Weakest Preconditions for Pure Prolog Programs, Inf. Process. Lett., vol. 67, pp. 145-150, 1998.
D. Pedreschi and Ruggieri, S., Verification of Logic Programs, J. Log. Program., vol. 39, pp. 125-176, 1999.
D. Pedreschi and Ruggieri, S., On Logic Programs That Do Not Fail, Electr. Notes Theor. Comput. Sci., vol. 30, 1999.
D. Pedreschi and Ruggieri, S., Bounded Nondeterminism of Logic Programs, in ICLP, 1999, pp. 350-364.
D. Pedreschi, Ruggieri, S., and Smaus, J. - G., Classes of Terminating Logic Programs, CoRR, vol. cs.LO/0106, 2001.
D. Pedreschi, Ruggieri, S., and Smaus, J. - G., Classes of terminating logic programs, TPLP, vol. 2, pp. 369-418, 2002.
D. Pedreschi and Ruggieri, S., On logic programs that always succeed, Sci. Comput. Program., vol. 48, pp. 163-196, 2003.
D. Pedreschi and Ruggieri, S., Bounded Nondeterminism of Logic Programs, Ann. Math. Artif. Intell., vol. 42, pp. 313-343, 2004.
D. Pedreschi, Ruggieri, S., and Smaus, J. - G., Characterisations of Termination in Logic Programming, in Program Development in Computational Logic, 2004, pp. 376-431.
D. Pedreschi, Ruggieri, S., and Turini, F., Integrating induction and deduction for finding evidence of discrimination, in ICAIL, 2009, pp. 157-166.
D. Pedreschi, Ruggieri, S., and Turini, F., Measuring Discrimination in Socially-Sensitive Decision Records, in SDM, 2009, pp. 581-592.
D. Pedreschi, Ruggieri, S., and Turini, F., Discrimination-aware data mining, in KDD, 2008, pp. 560-568.
D. Pedreschi, Bonchi, F., Turini, F., Verykios, V. S., Atzori, M., Malin, B., Moelans, B., and Saygin, Y., Privacy Protection: Regulations and Technologies, Opportunities and Threats, in Mobility, Data Mining and Privacy, 2008, pp. 101-119.
D. Pedreschi, Ruggieri, S., and Turini, F., The discovery of discrimination, in Discrimination and privacy in the information society, Springer, 2013, pp. 91–108.
D. Pedreschi, Giannotti, F., Guidotti, R., Monreale, A., Pappalardo, L., Ruggieri, S., and Turini, F., Open the Black Box Data-Driven Explanation of Black Box Decision Systems, 2018.
D. Pedreschi, Giannotti, F., Guidotti, R., Monreale, A., Ruggieri, S., and Turini, F., Meaningful explanations of Black Box AI decision systems, in Proceedings of the AAAI Conference on Artificial Intelligence, 2019.
D. Pedreschi and Miliou, I., Artificial Intelligence (AI): new developments and innovations applied to e-commerce, European Parliament's committee on the Internal Market and Consumer Protection, 2020.