Alessandro Previti

Orcid: 0000-0003-4209-2946

According to our database1, Alessandro Previti authored at least 26 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Generating Monolithic and Model Reconciling Explanations in Probabilistic Scenarios.
CoRR, 2024

2023
ASP and subset minimality: Enumeration, cautious reasoning and MUSes.
Artif. Intell., July, 2023

2022
Enumeration of Minimal Models and MUSes in WASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

2021
On Exploiting Hitting Sets for Model Reconciliation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Machine Reasoning Explainability.
CoRR, 2020

2019
Minipref: A Tool for Preferences in SAT (short paper).
Proceedings of the Joint Proceedings of the RCRA International Workshop and of the RCRA Incontri e Confronti Workshop co-located with the 18th International Conference of the Italian Association for Artificial Intelligence (AIIA 2019), 2019

2018
Cautious reasoning in ASP via minimal models and unsatisfiable cores.
Theory Pract. Log. Program., 2018

A preference-based approach to backbone computation with application to argumentation.
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

Premise Set Caching for Enumerating Minimal Correction Subsets.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Improving MCS Enumeration via Caching.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

On Computing Generalized Backbones.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016
Fast, flexible MUS enumeration.
Constraints An Int. J., 2016

MCS Extraction with Sublinear Oracle Queries.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On Finding Minimum Satisfying Assignments.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
SAT-Based Horn Least Upper Bounds.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

SAT-Based Formula Simplification.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Prime Compilation of Non-Clausal Formulae.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Literal-Based MCS Extraction.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Smallest MUS Extraction with Minimal Hitting Set Dualization.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
On Computing Preferred MUSes and MCSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
On Computing Minimal Correction Subsets.
Proceedings of the IJCAI 2013, 2013

Partial MUS Enumeration.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2011
Applying UCT to Boolean Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Monte-Carlo Style UCT Search for Boolean Satisfiability.
Proceedings of the AI*IA 2011: Artificial Intelligence Around Man and Beyond, 2011


  Loading...