Coherent SAT solvers: a tutorial

S Reifenstein, T Leleu, T McKenna… - Advances in Optics …, 2023 - opg.optica.org
The coherent Ising machine (CIM) is designed to solve the NP-hard Ising problem quickly
and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are …

On relating explanations and adversarial examples

A Ignatiev, N Narodytska… - Advances in neural …, 2019 - proceedings.neurips.cc
The importance of explanations (XP's) of machine learning (ML) model predictions and of
adversarial examples (AE's) cannot be overstated, with both arguably being essential for the …

[PDF][PDF] Simple, efficient, highly secure, and multiple purposed method on data cryptography

M Mua'ad, K Aldebei, ZA Alqadi - Traitement du Signal, 2022 - academia.edu
Accepted: 3 January 2022 Some digital data circulated through various social media,
regardless of its nature, requires high-level protection and security for various reasons. In …

Enhancing self-consistency and performance of pre-trained language models through natural language inference

E Mitchell, JJ Noh, S Li, WS Armstrong… - arXiv preprint arXiv …, 2022 - arxiv.org
While large pre-trained language models are powerful, their predictions often lack logical
consistency across test inputs. For example, a state-of-the-art Macaw question-answering …

From contrastive to abductive explanations and back again

A Ignatiev, N Narodytska, N Asher… - … Conference of the Italian …, 2020 - Springer
Abstract Explanations of Machine Learning (ML) models often address a question. Such
explanations can be related with selecting feature-value pairs which are sufficient for the …

Using MaxSAT for efficient explanations of tree ensembles

A Ignatiev, Y Izza, PJ Stuckey… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Tree ensembles (TEs) denote a prevalent machine learning model that do not offer
guarantees of interpretability, that represent a challenge from the perspective of explainable …

Quantum-informed recursive optimization algorithms

JR Finžgar, A Kerschbaumer, MJA Schuetz, CB Mendl… - PRX Quantum, 2024 - APS
We propose and implement a family of quantum-informed recursive optimization (QIRO)
algorithms for combinatorial optimization problems. Our approach leverages quantum …

SAT-based rigorous explanations for decision lists

A Ignatiev, J Marques-Silva - … and Applications of Satisfiability Testing–SAT …, 2021 - Springer
Decision lists (DLs) find a wide range of uses for classification problems in Machine
Learning (ML), being implemented in anumber of ML frameworks. DLs are often perceived …

Certified dominance and symmetry breaking for combinatorial optimisation

B Bogaerts, S Gocht, C McCreesh… - Journal of Artificial …, 2023 - jair.org
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …

Internal consistency and self-feedback in large language models: A survey

X Liang, S Song, Z Zheng, H Wang, Q Yu, X Li… - arXiv preprint arXiv …, 2024 - arxiv.org
Large language models (LLMs) are expected to respond accurately but often exhibit
deficient reasoning or generate hallucinatory content. To address these, studies prefixed …