default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Previti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Ajay Kattepur, Pedro Batista, Alessandro Previti, Konstantinos Vandikas:
Integrate: Intent-Driven Router Queue Depth Configuration via Reinforcement Learning. 6GNet 2024: 258-266- [i4]Stylianos Loukas Vasileiou, William Yeoh, Alessandro Previti, Tran Cao Son:
On Generating Monolithic and Model Reconciling Explanations in Probabilistic Scenarios. CoRR abs/2405.19229 (2024) - 2023
- [j3]Mario Alviano, Carmine Dodaro
, Salvatore Fiorentino, Alessandro Previti, Francesco Ricca:
ASP and subset minimality: Enumeration, cautious reasoning and MUSes. Artif. Intell. 320: 103931 (2023) - 2022
- [c21]Mario Alviano, Carmine Dodaro, Salvatore Fiorentino, Alessandro Previti, Francesco Ricca:
Enumeration of Minimal Models and MUSes in WASP. LPNMR 2022: 29-42 - 2021
- [c20]Stylianos Loukas Vasileiou, Alessandro Previti, William Yeoh:
On Exploiting Hitting Sets for Model Reconciliation. AAAI 2021: 6514-6521 - 2020
- [i3]Kristijonas Cyras, Ramamurthy Badrinath, Swarup Kumar Mohalik, Anusha Mujumdar, Alexandros Nikou, Alessandro Previti, Vaishnavi Sundararajan, Aneta Vulgarakis Feljan:
Machine Reasoning Explainability. CoRR abs/2009.00418 (2020) - [i2]Stylianos Loukas Vasileiou, Alessandro Previti, William Yeoh:
On Exploiting Hitting Sets for Model Reconciliation. CoRR abs/2012.09274 (2020)
2010 – 2019
- 2019
- [c19]Carmine Dodaro, Alessandro Previti:
Minipref: A Tool for Preferences in SAT (short paper). RCRA/RiCeRcA@AI*IA 2019 - 2018
- [j2]Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, Alessandro Previti:
Cautious reasoning in ASP via minimal models and unsatisfiable cores. Theory Pract. Log. Program. 18(3-4): 319-336 (2018) - [c18]Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva:
Premise Set Caching for Enumerating Minimal Correction Subsets. AAAI 2018: 6633-6640 - [c17]Alessandro Previti, Matti Järvisalo:
A preference-based approach to backbone computation with application to argumentation. SAC 2018: 896-902 - [i1]Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, Alessandro Previti:
Cautious reasoning in ASP via minimal models and unsatisfiable cores. CoRR abs/1804.08480 (2018) - 2017
- [c16]Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, João Marques-Silva:
On Computing Generalized Backbones. ICTAI 2017: 1050-1056 - [c15]Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva:
Improving MCS Enumeration via Caching. SAT 2017: 184-194 - 2016
- [j1]Mark H. Liffiton, Alessandro Previti, Ammar Malik, João Marques-Silva:
Fast, flexible MUS enumeration. Constraints An Int. J. 21(2): 223-250 (2016) - [c14]Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
On Finding Minimum Satisfying Assignments. CP 2016: 287-297 - [c13]Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
MCS Extraction with Sublinear Oracle Queries. SAT 2016: 342-360 - 2015
- [c12]Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva:
Smallest MUS Extraction with Minimal Hitting Set Dualization. CP 2015: 173-182 - [c11]Carlos Mencía, Alessandro Previti, João Marques-Silva:
Literal-Based MCS Extraction. IJCAI 2015: 1973-1979 - [c10]Alessandro Previti, Alexey Ignatiev, António Morgado, João Marques-Silva:
Prime Compilation of Non-Clausal Formulae. IJCAI 2015: 1980-1988 - [c9]Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
SAT-Based Formula Simplification. SAT 2015: 287-298 - [c8]Carlos Mencía, Alessandro Previti, João Marques-Silva:
SAT-Based Horn Least Upper Bounds. SAT 2015: 423-433 - 2014
- [c7]Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems. CPAIOR 2014: 368-376 - [c6]Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:
Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems. ECAI 2014: 1065-1066 - [c5]João Marques-Silva, Alessandro Previti:
On Computing Preferred MUSes and MCSes. SAT 2014: 58-74 - 2013
- [c4]Alessandro Previti, João Marques-Silva:
Partial MUS Enumeration. AAAI 2013: 818-825 - [c3]João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov:
On Computing Minimal Correction Subsets. IJCAI 2013: 615-622 - 2011
- [c2]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Monte-Carlo Style UCT Search for Boolean Satisfiability. AI*IA 2011: 177-188 - [c1]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Applying UCT to Boolean Satisfiability. SAT 2011: 373-374
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
