Alessandro Previti's home

This is the personal webpage of Alessandro Previti. I completed my PhD at University College Dublin in July 2015. I'm currently a Post-doctoral researcher at University of Helsinki. My research focuses on the analysis of over-constrained systems in the Boolean domain. Besides this, my current research interests include Model Counting and Model Enumeration.

Contacts

email: apreviti DOT research AT gmail DOT com

Papers

  • On computing minimal correction subsets [pdf] Joao Marques-Silva, Federico Heras, Mikolas Janota, Alessandro Previti, and Anton Belov. In IJCAI, July 2013

  • Partial MUS enumeration [pdf] Alessandro Previti and Joao Marques-Silva. In AAAI, July 2013

  • Fast, flexible MUS enumeration [pdf] Mark H Liffiton, Alessandro Previti, Ammar Malik, Joao Marques-Silva. In Constraints, pages 1-28, 2015

  • Literal-based MCS extraction [pdf] Carlos Mencıa, Alessandro Previti, Joao Marques-Silva. In IJCAI 2015

  • Smallest MUS extraction with minimal hitting set dualization [pdf] Alexey Ignatiev, Alessandro Previti, Mark Liffiton, Joao Marques-Silva. In CP 2015

  • Prime Compilation of Non-Clausal Formulae [pdf] Alessandro Previti, Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva. In IJCAI 2015

  • On computing preferred MUSes and MCSes [pdf] Joao Marques-Silva, Alessandro Previti. In SAT 2014

  • Monte-Carlo Style UCT Search for Boolean Satisfiability [pdf] Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman. In AI*IA 2011

  • MCS extraction with sublinear oracle queries [pdf] Carlos Mencía, Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva. In SAT 2016

  • A portfolio approach to enumerating minimal correction subsets for satisfiability problems [pdf] Yuri Malitsky, Barry O’Sullivan, Alessandro Previti, Joao Marques-Silva. In CPAIOR 2014

  • Applying UCT to boolean satisfiability [pdf] Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman. In SAT 2011

  • Sat-based formula simplification [pdf] Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva. In SAT 2015

  • Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems [pdf] Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, Joao Marques-Silva. In ECAI 2014

  • On Finding Minimum Satisfying Assignments [pdf] Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva. In CP 2016

  • SAT-based Horn least upper bounds [pdf] Carlos Mencía, Alessandro Previti, Joao Marques-Silva. In SAT 2015

  • Improving MCS Enumeration via Caching [pdf] Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva. In SAT 2017

  • On Computing Generalized Backbones [pdf] Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, Joao Marques-Silva. In ICTAI 2017

Software

  • lbx-cache [download]

  • argpref [download]

  • primer [download]

  • eMUS [download]

  • minipref [link]