-
-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' of github.com:meelgroup/meelgroup-website
- Loading branch information
Showing
6 changed files
with
66 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
@inproceedings{IMS24, | ||
title={Locally-Minimal Probabilistic Explanations}, | ||
author={Yacine Izza and Kuldeep S Meel and Joao Marques-Silva}, | ||
booktitle={Proceedings of ECAI}, | ||
year={2024}, | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
--- | ||
abstract: Formal abductive explanations offer crucial guarantees of rigor and so find application in high-stakes uses of machine learning (ML). One drawback of abductive explanations is explanation size, justified by the cognitive limits of human decision-makers. Probabilistic abductive explanations (PAXps) address this limitation, but their theoretical and practical complexity makes their exact computation most often unrealistic. This paper proposes novel efficient algorithms for the computation of locally-minimal PXAps, which offer high-quality approximations of PXAps in practice. The experimental results demonstrate the practical efficiency of the proposed algorithms. | ||
|
||
|
||
authors: | ||
- Yacine Izza, | ||
- Kuldeep S Meel, | ||
- Joao Marques-Silva | ||
date: 2024-10-21 00:00:00 | ||
highlight: true | ||
image_preview: '' | ||
math: false | ||
publication: In *Proceedings of ECAI - European Conference on Artificial Intelligence* | ||
publication_types: | ||
- '1' | ||
selected: true | ||
title: Locally-Minimal Probabilistic Explanations | ||
url_pdf: https://arxiv.org/pdf/2312.11831 | ||
--- |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,39 @@ | ||
+++ | ||
date = 2024-05-23T00:00:00 # Schedule page publish date. | ||
|
||
title='<b>Our work on Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving</a> has been accepted to <a href="http://satisfiability.org/SAT24/">SAT 2024</a>.</b> <br> We introduce a novel circuit mapping method by combining incremental and parallel solving for Boolean Satisfiability (SAT). We present an innovative SAT encoding for circuit mapping problems, which significantly improves solver-based mapping methods and provides a smooth trade-off between compilation quality and compilation time. <br> Authors: Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn Heule, and Bruno Dutertre <br> ' | ||
time_start = 2024-05-23T01:00:00 | ||
#time_end = 2030-06-01T15:00:00 | ||
abstract = "" | ||
abstract_short = "" | ||
event = "" | ||
event_url = "" | ||
location = "" | ||
|
||
# Is this a selected talk? (true/false) | ||
selected = false | ||
|
||
# Projects (optional). | ||
# Associate this talk with one or more of your projects. | ||
# Simply enter the filename (excluding '.md') of your project file in `content/project/`. | ||
projects = [] | ||
|
||
# Links (optional). | ||
url_pdf = "" | ||
url_slides = "" | ||
url_video = "" | ||
url_code = "" | ||
|
||
# Does the content use math formatting? | ||
math = true | ||
|
||
# Does the content use source code highlighting? | ||
highlight = true | ||
|
||
# Featured image | ||
# Place your image in the `static/img/` folder and reference its filename below, e.g. `image = "example.jpg"`. | ||
[header] | ||
image = "" | ||
caption = "" | ||
|
||
+++ |