( en | de | ru )

 

Disambiguation of "Saïs, Lakhdar"

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of computing minimal unsatisfiable LTL formulas.

, , and . Electron. Colloquium Comput. Complex., (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lakhdar Akroun

Siham Sais

Anne Saison

Victor Ricardo Enriquez Sais

 

Other publications of authors with the same name

On the complexity of computing minimal unsatisfiable LTL formulas., , and . Electron. Colloquium Comput. Complex., (2012)Intensification Search in Modern SAT Solvers - (Poster Presentation)., , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 491-492. Springer, (2012)About some UP-based polynomial fragments of SAT., , , , and . Ann. Math. Artif. Intell., 79 (1-3): 25-44 (2017)What we can learn from conflicts in propositional satisfiability., , and . Ann. Oper. Res., 240 (1): 13-37 (2016)About Some UP-Based Polynomial Fragments of SAT., , , and . ISAIM, (2014)A Comparative Study of SAT-Based Itemsets Mining., , , and . SGAI Conf., page 37-52. Springer, (2016)Extracting Frequent Gradual Patterns Using Constraints Modeling., , , , and . CoRR, (2019)Revisiting the Learned Clauses Database Reduction Strategies., , , and . Int. J. Artif. Intell. Tools, 27 (8): 1850033:1-1850033:19 (2018)A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence., , , and . ECAI, volume 242 of Frontiers in Artificial Intelligence and Applications, page 258-263. IOS Press, (2012)Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers., , and . SARA, AAAI, (2013)