2 Search Results for "Cherif, Mohamed Sami"

Document
DOI: 10.4230/LIPIcs.CP.2022.12
From Crossing-Free Resolution to Max-SAT Resolution

Authors: Mohamed Sami Cherif, Djamal Habet, and Matthieu Py

Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)

Abstract
Adapting a SAT resolution proof into a Max-SAT resolution proof without considerably increasing its size is an open problem. Read-once resolution, where each clause is used at most once in the proof, represents the only fragment of resolution for which an adaptation using exclusively Max-SAT resolution is known and trivial. Proofs containing non read-once clauses are difficult to adapt because the Max-SAT resolution rule replaces the premises by the conclusions. This paper contributes to this open problem by defining, for the first time since the introduction of Max-SAT resolution, a new fragment of resolution whose proofs can be adapted to Max-SAT resolution proofs without substantially increasing their size. In this fragment, called crossing-free resolution, non read-once clauses are used independently to infer new information thus enabling to bring along each non read-once clause while unfolding the proof until a substitute is required.
Cite as

Mohamed Sami Cherif, Djamal Habet, and Matthieu Py. From Crossing-Free Resolution to Max-SAT Resolution. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{cherif_et_al:LIPIcs.CP.2022.12,
  author =	{Cherif, Mohamed Sami and Habet, Djamal and Py, Matthieu},
  title =	{{From Crossing-Free Resolution to Max-SAT Resolution}},
  booktitle =	{28th International Conference on Principles and Practice of Constraint Programming (CP 2022)},
  pages =	{12:1--12:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-240-2},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{235},
  editor =	{Solnon, Christine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.12},
  URN =		{urn:nbn:de:0030-drops-166412},
  doi =		{10.4230/LIPIcs.CP.2022.12},
  annote =	{Keywords: Satisfiability, Proof, Max-SAT Resolution}
}
Document
DOI: 10.4230/LIPIcs.CP.2021.20
Combining VSIDS and CHB Using Restarts in SAT

Authors: Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux

Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)

Abstract
Conflict Driven Clause Learning (CDCL) solvers are known to be efficient on structured instances and manage to solve ones with a large number of variables and clauses. An important component in such solvers is the branching heuristic which picks the next variable to branch on. In this paper, we evaluate different strategies which combine two state-of-the-art heuristics, namely the Variable State Independent Decaying Sum (VSIDS) and the Conflict History-Based (CHB) branching heuristic. These strategies take advantage of the restart mechanism, which helps to deal with the heavy-tailed phenomena in SAT, to switch between these heuristics thus ensuring a better and more diverse exploration of the search space. Our experimental evaluation shows that combining VSIDS and CHB using restarts achieves competitive results and even significantly outperforms both heuristics for some chosen strategies.
Cite as

Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux. Combining VSIDS and CHB Using Restarts in SAT. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{cherif_et_al:LIPIcs.CP.2021.20,
  author =	{Cherif, Mohamed Sami and Habet, Djamal and Terrioux, Cyril},
  title =	{{Combining VSIDS and CHB Using Restarts in SAT}},
  booktitle =	{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
  pages =	{20:1--20:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-211-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{210},
  editor =	{Michel, Laurent D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.20},
  URN =		{urn:nbn:de:0030-drops-153110},
  doi =		{10.4230/LIPIcs.CP.2021.20},
  annote =	{Keywords: Satisfiability, Branching Heuristic, Restarts}
}
  • Refine by Author
  • 2 Cherif, Mohamed Sami
  • 2 Habet, Djamal
  • 1 Py, Matthieu
  • 1 Terrioux, Cyril

  • Refine by Classification
  • 1 Computing methodologies → Artificial intelligence
  • 1 Theory of computation → Proof theory

  • Refine by Keyword
  • 2 Satisfiability
  • 1 Branching Heuristic
  • 1 Max-SAT Resolution
  • 1 Proof
  • 1 Restarts

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2021
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact