Filtrer vos résultats
- 32
- 5
- 26
- 9
- 1
- 1
- 37
- 5
- 6
- 4
- 8
- 5
- 2
- 6
- 1
- 36
- 1
- 36
- 6
- 6
- 5
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 37
- 6
- 6
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
37 résultats
|
|
|
triés par
|
|
|
Revisiting Graph Width Measures for CNF-Encodings22nd 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⟩
Communication dans un congrès
hal-02351441v1
|
||
On Irrelevant Literals in Pseudo-Boolean Constraint Learning10th International Workshop on Pragmatics of SAT (POS'19), Jul 2019, Lisbonne, Portugal
Communication dans un congrès
hal-03457395v1
|
|||
Counting Answers to Existential Positive Queries: A Complexity Classification35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS'16), 2016, San Francisco, CA, USA, Unknown Region. pp.315--326
Communication dans un congrès
hal-03301000v1
|
|||
|
|
Minimal Distance of Propositional ModelsTheory of Computing Systems, 2019, 63 (6), pp.1131-1184. ⟨10.1007/s00224-018-9896-8⟩
Article dans une revue
hal-02322184v1
|
||
|
|
Proof Complexity of Symbolic QBF Reasoning24th International Conference Theory and Applications of Satisfiability Testing (SAT 2021), Jul 2021, Barcelona, Spain. pp.399-416, ⟨10.1007/978-3-030-80223-3_28⟩
Communication dans un congrès
hal-03379991v1
|
||
|
|
QBF as an Alternative to Courcelle’s Theorem21st International Conference on Theory and Applications of Satisfiability Testing – SAT 2018, Jul 2018, Oxford, United Kingdom. pp.235-252, ⟨10.1007/978-3-319-94144-8_15⟩
Communication dans un congrès
hal-02187884v1
|
||
|
|
Tractable QBF by Knowledge Compilation36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany
Communication dans un congrès
hal-01836402v1
|
||
|
|
On the relative power of reduction notions in arithmetic circuit complexityInformation Processing Letters, 2018, 130, pp.7-10. ⟨10.1016/j.ipl.2017.09.009⟩
Article dans une revue
hal-02351518v1
|
||
|
|
De la pertinence des littéraux dans les contraintes pseudo-booléennes apprises15es Journées Francophones de Programmation par Contraintes (JFPC’19), Jun 2019, Albi, France. pp.43-52
Communication dans un congrès
hal-02912461v1
|
||
|
|
Characterizing Tractability of Simple Well-Designed Pattern Trees with ProjectionTheory of Computing Systems, 2021, 65 (1), pp.3-41. ⟨10.1007/s00224-020-10002-z⟩
Article dans une revue
hal-03402343v1
|
||
As Close as It Gets10th International Workshop on Algorithms and Computation (WALCOM '16), 2016, Kathmandu, Nepal. pp.222--235
Communication dans un congrès
hal-03300998v1
|
|||
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16), 2016, Bordeaux, France. pp.3--12
Communication dans un congrès
hal-03300999v1
|
|||
|
|
Changing Partitions in Rectangle Decision Lists25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩
Communication dans un congrès
hal-03864946v1
|
||
|
|
A Compilation of Succinctness Results for Arithmetic Circuits18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Nov 2021, Online Event, Vietnam
Communication dans un congrès
hal-03517923v1
|
||
|
|
Constant-Delay Enumeration for Nondeterministic Document SpannersACM Transactions on Database Systems, 2021, 46 (1), pp.1-30. ⟨10.1145/3436487⟩
Article dans une revue
hal-03402446v1
|
||
|
|
On Irrelevant Literals in Pseudo-Boolean Constraint Learning29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩
Communication dans un congrès
hal-02912451v1
|
||
|
|
Graph Width Measures for CNF-Encodings with Auxiliary VariablesJournal of Artificial Intelligence Research, 2020, 67, pp.409-436. ⟨10.1613/jair.1.11750⟩
Article dans une revue
hal-02912390v1
|
||
|
|
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations24th International Conference Theory and Applications of Satisfiability Testing - SAT 2021, Jul 2021, Barcelona, Spain. pp.116-133, ⟨10.1007/978-3-030-80223-3_9⟩
Communication dans un congrès
hal-03402246v1
|
||
|
|
Enumeration on Trees under Relabelings21st International Conference on Database Theory,ICDT 2018, Mar 2018, Vienna, Austria. ⟨10.4230/LIPIcs.ICDT.2018.5⟩
Communication dans un congrès
hal-02412744v1
|
||
|
|
Counting, Knowledge Compilation and ApplicationsArtificial Intelligence [cs.AI]. Université d'Artois, 2021
HDR
tel-03611336v1
|
||
Knowledge Compilation Meets Communication Complexity25th International Joint Conference on Artificial Intelligence (IJCAI'16), 2016, New York, NY, USA, Unknown Region. pp.1008--1014
Communication dans un congrès
hal-03301001v1
|
|||
|
|
Enumeration on Trees with Tractable Combined Complexity and Efficient UpdatesPODS, Jun 2019, Amsterdam, France. pp.89-103, ⟨10.1145/3294052.3319702⟩
Communication dans un congrès
hal-02326243v1
|
||
|
|
No Efficient Disjunction or Conjunction of Switch-ListsJournal on Satisfiability, Boolean Modeling and Computation, 2022, 13 (1), pp.1-4. ⟨10.3233/sat-220002⟩
Article dans une revue
hal-03857103v1
|
||
|
|
Lower Bounds for Approximate Knowledge CompilationTwenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jul 2020, Yokohama, Japan. pp.1834-1840, ⟨10.24963/ijcai.2020/254⟩
Communication dans un congrès
hal-02976041v1
|
||
|
|
Constant-Delay Enumeration for Nondeterministic Document SpannersSIGMOD record, 2020, 49 (1), pp.25-32. ⟨10.1145/3422648.3422655⟩
Article dans une revue
hal-03046848v1
|
||
|
|
Pseudo-Boolean Constraints from a Knowledge Representation Perspective27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩
Communication dans un congrès
hal-02310063v1
|
||
|
|
Tight Fine-Grained Bounds for Direct Access on Join QueriesSIGMOD/PODS '22: International Conference on Management of Data, Jun 2022, Philadelphia PA, United States. pp.427-436, ⟨10.1145/3517804.3526234⟩
Communication dans un congrès
hal-03864970v1
|
||
|
|
Tight Fine-Grained Bounds for Direct Access on Join Queries2022
Pré-publication, Document de travail
hal-03654342v1
|
||
The logic of counting query answers32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'17), 2017, Reykjavik, Iceland. pp.1-12
Communication dans un congrès
hal-03300997v1
|
|||
|
|
Monomials in arithmetic circuits: Complete problems in the counting hierarchySTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.362-373
Communication dans un congrès
hal-00678195v1
|
- 1
- 2