5 papers · 1 filter
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…
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…
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…