158 citations · 161 across the 9 of their papers we have counts for
9 papers
MaxSAT-Based Feedback for Guiding Vision-Language Models in Sudoku
Pedro Orvalho, Guillem Alenyà, Felip Manyà
Vision--Language Models (VLMs) have recently demonstrated promising performance on structured visual reasoning tasks, including grid-based puzzles. However, despite strong perceptu…
Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability
Pedro Orvalho, Marta Kwiatkowska, Guillem Alenyà +1
Large Language Models (LLMs) excel at understanding natural language but struggle with optimisation tasks involving multiple constraints and user-defined preferences, which commonl…
ByteShield: Adversarially Robust End-to-End Malware Detection through Byte Masking
Daniel Gibert, Felip Manyà
Research has proven that end-to-end malware detectors are vulnerable to adversarial attacks. In response, the research community has proposed defenses based on randomized and (de)r…
DeepTrust: Multi-Step Classification through Dissimilar Adversarial Representations for Robust Android Malware Detection
Daniel Pulido-Cortázar, Daniel Gibert, Felip Manyà
Over the last decade, machine learning has been extensively applied to identify malicious Android applications. However, such approaches remain vulnerable against adversarial examp…
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called…
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMa…
Incomplete MaxSAT Approaches for Combinatorial Testing
Carlos Ansótegui, Felip Manyà, Jesus Ojeda +2
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This probl…
Clause Vivification by Unit Propagation in CDCL SAT Solvers
Chu-Min Li, Fan Xiao, Mao Luo +3
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant…
New Inference Rules for Max-SAT
C. M. Li, F. Manya, J. Planes
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplifie…