3 citations · 6 across the 7 of their papers we have counts for
8 papers
Evaluating Robustness of Reasoning Models on Parameterized Logical Problems
Naïm Es-sebbani, Esteban Marquer, Yakoub Salhi +1
Logic provides a controlled testbed for evaluating LLM-based reasoners, yet standard SAT-style benchmarks often conflate surface difficulty (length, wording, clause order) with the…
A Variable Occurrence-Centric Framework for Inconsistency Handling (Extended Version)
Yakoub Salhi
In this paper, we introduce a syntactic framework for analyzing and handling inconsistencies in propositional bases. Our approach focuses on examining the relationships between var…
On SAT Models Enumeration in Itemset Mining
Said Jabbour, Lakhdar Sais, Yakoub Salhi
Frequent itemset mining is an essential part of data analysis and data mining. Recent works propose interesting SAT-based encodings for the problem of discovering frequent itemsets…
On the measure of conflicts: A MUS-Decomposition Based Framework
Said Jabbour, Yue Ma, Badran Raddaoui +2
Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining s…
Revisiting the Learned Clauses Database Reduction Strategies
Said Jabbour, Jerry Lonlac, Lakhdar Sais +1
In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple obser…
A Mining-Based Compression Approach for Constraint Satisfaction Problems
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our…
Extending Modern SAT Solvers for Enumerating All Models
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF). We propose an extension of CDCL-based SAT solvers to deal wit…
Mining to Compact CNF Propositional Formulae
Said Jabbour, Lakhdar Sais, Yakoub Salhi
In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed Mining4SAT approach aims to discover and to exploit hidden str…