Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Salhi, Yakoub"'
Autor:
Salhi, Yakoub, Sioutis, Michael
Publikováno v:
In Information and Computation October 2024 300
Autor:
Salhi, Yakoub
En informatique, les logiques formelles ont une place centrale dans la représentation et le traitement des connaissances. Elles sont utilisées pour la modélisation et la vérification de systèmes informatiques et de leurs propriétés ainsi que p
Externí odkaz:
http://www.theses.fr/2010NAN10087/document
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. Our aim in this work is to define strategies for adapting SAT solver
Externí odkaz:
http://arxiv.org/abs/1506.02561
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 sound properties is sometimes problematic. In this paper, we emphasize
Externí odkaz:
http://arxiv.org/abs/1406.0155
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 observation on the remarkable performances of both random and size-bounded
Externí odkaz:
http://arxiv.org/abs/1402.1956
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 approach aims to reduce the size of the CSP by exploiting the structur
Externí odkaz:
http://arxiv.org/abs/1305.3321
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 with this fundamental problem. Then, we provide an experimental evaluatio
Externí odkaz:
http://arxiv.org/abs/1305.0574
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 structural knowledge for reducing the size of propositional formulae in c
Externí odkaz:
http://arxiv.org/abs/1304.4415
Publikováno v:
In Artificial Intelligence March 2017 244:30-47
Publikováno v:
In International Journal of Approximate Reasoning January 2017 80:443-459