Výsledky vyhledávání - "Romain Wallon"

Revisiting Graph Width Measures for CNF-Encodings

Publikováno v: Theory and Applications of Satisfiability Testing-SAT 2019
22nd International Conference on Theory and Applications of Satisfiability Testing (SAT'19)
22nd International Conference on Theory and Applications of Satisfiability Testing (SAT'19), Jul 2019, Lisbon, Portugal. pp.222-238, ⟨10.1007/978-3-030-24258-9_16⟩
Lecture Notes in Computer Science ISBN: 9783030242572
SAT

International audience; We consider bounded width CNF-formulas where the width is measured by popular graph width measures on graphs associated to CNF-formulas. Such restricted graph classes, in particular those of bounded treewidth, have been extens

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19263fda48f029ba40bbed4b52e629db
https://doi.org/10.1613/jair.1.11750

Zobrazit plný text záznamu

On Dedicated CDCL Strategies for PB Solvers

Autor: Daniel Le Berre, Romain Wallon

Publikováno v: Theory and Applications of Satisfiability Testing-SAT 2021
24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21)
24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21), Jul 2021, Barcelona (en ligne), Spain. pp.315-331, ⟨10.1007/978-3-030-80223-3_22⟩
Theory and Applications of Satisfiability Testing – SAT 2021 ISBN: 9783030802226
SAT

International audience; Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers. In particular, such PB solvers not only implement a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42b4f0883500bf900c7109a94756a05a

Zobrazit plný text záznamu

On Weakening Strategies for PB Solvers

Autor: Daniel Le Berre, Pierre Marquis, Romain Wallon

Publikováno v: Theory and Applications of Satisfiability Testing – SAT 2020
23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20)
23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20), Jul 2020, Alghero (en ligne), Italy. pp.322-331, ⟨10.1007/978-3-030-51825-7_23⟩
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT

International audience; Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generalized resolution, which allows to infer strong co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea9d5dfe40a24967dc1b7bdb8ce86737
http://arxiv.org/abs/2005.04466

Zobrazit plný text záznamu

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

Autor: Daniel Le Berre, Pierre Marquis, Romain Wallon, Stefan Mengel

Publikováno v: 29th International Joint Conference on Artificial Intelligence (IJCAI'20)
29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩
HAL

Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning solvers. In this paper, we show that PB constraints derived using cutting

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cb5f956581f711c7b03c9728554d075
https://hal.archives-ouvertes.fr/hal-03457395

Zobrazit plný text záznamu

Pseudo-Boolean Constraints from a Knowledge Representation Perspective

Autor: Daniel Le Berre, Pierre Marquis, Romain Wallon, Stefan Mengel

Publikováno v: 27th International Joint Conference on Artificial Intelligence (IJCAI'18)
27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩
IJCAI

We study pseudo-Boolean constraints (PBC) and their special case cardinality constraints (CARD) from the perspective of knowledge representation. To this end, the succinctness of PBC and CARD is compared to that of many standard propositional languag

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fb72627bc8946fc29d62baf06716358
https://hal.archives-ouvertes.fr/hal-02310063

Zobrazit plný text záznamu

Metrics: Towards a Unified Library for Experimenting Solvers

Autor: Thibault Falque, Romain Wallon, Hugues Wattez

Publikováno v: HAL
11th International Workshop on Pragmatics of SAT (POS'20)
11th International Workshop on Pragmatics of SAT (POS'20), Jul 2020, Alghero (en ligne), Italy

International audience; When developing a SAT solver, one of the most important parts is to perform experiments so as to evaluate its performance. Most of the time, this process remains the same, so that everybody collects almost the same statistics

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f2889608e606e6f52a0b7763233801cd
https://hal-univ-artois.archives-ouvertes.fr/hal-03301303

Zobrazit plný text záznamu

De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises

Autor: Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon

Publikováno v: HAL
15es Journées Francophones de Programmation par Contraintes (JFPC’19)
15es Journées Francophones de Programmation par Contraintes (JFPC’19), Jun 2019, Albi, France. pp.43-52

National audience; L'apprentissage de contraintes pseudo-booléennes (PB) dans les solveurs PB via le système de preuve des plans-coupes n'est pas aussi bien compris que celui des clauses dans les solveurs SAT utilisant l'analyse de conflit. En part

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c6f09937132dc8d8a1167fd0697d4b22
https://hal.archives-ouvertes.fr/hal-02912461

Zobrazit plný text záznamu

Metrics : Mission Expérimentations

Autor: Thibault Falque, Romain Wallon, Hugues Wattez

Publikováno v: HAL
16es Journées Francophones de Programmation par Contraintes (JFPC’21)
16es Journées Francophones de Programmation par Contraintes (JFPC’21), Jun 2021, Nice (en ligne), France

National audience; Le développement de solveurs de contraintes s'accompagne nécessairement d'une phase d'expérimentation, permettant d'évaluer les performances des fonctionnalités implantées. Pour chacun des solveurs considérés, il faut alors

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a4ff1822c713ef451630a053a16eadf0
https://hal.archives-ouvertes.fr/hal-03295285

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání