Filter your results
- 9
- 7
- 14
- 1
- 1
- 16
- 1
- 4
- 5
- 4
- 2
- 12
- 4
- 16
- 4
- 1
- 15
- 14
- 8
- 5
- 4
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Consolidating Modal Knowledge Bases24th European Conference on Artificial Intelligence (ECAI'20), 2020, Santiago de Compostela, Spain
Conference papers
hal-03300236v1
|
||
|
Une approche SAT incrémentale pour raisonner efficacement sur les réseaux de contraintes qualitatives JFPC 2019 - Actes des 15es Journées Francophones de Programmation par Contraintes, Jun 2019, Albi, France
Conference papers
hal-02271390v1
|
||
An Incremental SAT-Based Approach for Graph Colouring ProblemThe 25th International Conference on Principles and Practice of Constraint Programming, Sep 2019, Stamford, CT, United States
Conference papers
hal-02271397v1
|
|||
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks24th International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. pp.160-178, ⟨10.1007/978-3-319-98334-9_11⟩
Conference papers
hal-02067915v1
|
|||
|
Une approche SAT sensible à la mémoire pour les logiques modales PSPACEJIAF 2019 - 13es Journées de l'Intelligence Artificielle Fondamentale, Jul 2019, Toulouse, France
Conference papers
hal-02271392v1
|
||
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability ProblemTwenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.674-680
Conference papers
hal-02271412v1
|
|||
|
A SAT-Based Approach For PSPACE Modal LogicsPrinciples of Knowledge Representation and Reasoning: Sixteenth International Conference, Oct 2018, Tempe, United States
Conference papers
hal-02271405v1
|
||
pFactory: A generic library for designing parallel solversInternational Conference on Applied Computing (AC), 2019, Cagliari, Italy
Conference papers
hal-03299476v1
|
|||
|
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability ProblemAutomated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Jul 2018, Oxford, United Kingdom. pp.1-18
Conference papers
hal-02271403v1
|
||
|
On Checking Kripke Models for Modal Logic KProceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), Coimbra, Portugal, July 2nd, 2016., Jul 2016, Coimbra, Portugal
Conference papers
hal-02271413v1
|
||
|
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability ProblemThirty-First AAAI Conference on Artificial Intelligence, Feb 2017, San Francisco, United States
Conference papers
hal-02271408v1
|
||
Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K11e Journées d'Intelligence Artificielle Fondamentale, Jul 2017, Caen, France
Conference papers
hal-01575536v1
|
|||
A propos de la vérification de modèles en logique modale K10es Journées d’Intelligence Artificielle Fondamentale (IAF 2016), Jun 2016, Montpellier, France. ⟨10.13140/RG.2.1.1178.5843⟩
Conference papers
hal-01332832v1
|
|||
An Incremental SAT-Based Approach to Reason Efficiently On Qualitative Constraint Network24th International Conference on Principles and Practice of Constraint Programming (CP'18), 2018, Lille, France. pp.160--178
Conference papers
hal-03300778v1
|
|||
|
Practical resolution of satisfiability testing for modal logicsComputer Science [cs]. Université d'Artois, 2018. English. ⟨NNT : ⟩
Theses
tel-02886382v1
|
||
|
The Hill Cipher: A Weakness Studied Through Group Action Theory2017
Other publications
hal-01631232v1
|