Filter your results
- 16
- 9
- 15
- 5
- 2
- 1
- 1
- 1
- 25
- 1
- 1
- 1
- 1
- 2
- 3
- 2
- 3
- 6
- 5
- 2
- 25
- 25
- 24
- 24
- 2
- 1
- 1
- 25
- 6
- 6
- 4
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
25 Results
|
|
sorted by
|
|
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality8th International Joint Conference on Automated Reasoning (IJCAR 2016), Jun 2016, Coimbra, Portugal. ⟨10.1007/978-3-319-40229-1_4⟩
Conference papers
hal-01336074v1
|
||
BDI: a new decidable clause classJournal of Logic and Computation, 2014, 24 (6), pp.28
Journal articles
hal-01098084v1
|
|||
|
A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished ColumnJournal of Automated Reasoning, 2022, 66 (4), pp.575-584. ⟨10.1007/s10817-022-09617-3⟩
Journal articles
hal-03935941v1
|
||
|
{NRCL} - a model building approach to the {Bernays-Schönfinkel} fragmentFrontiers of Combining Systems, 10th International Symposium (FroCos 2015), 2015, Wroclaw, Poland. pp.69-84, ⟨10.1007/978-3-319-24246-0_5⟩
Conference papers
hal-01247991v1
|
||
|
Linear Integer Arithmetic Revisited2015
Preprints, Working Papers, ...
hal-03145059v1
|
||
|
Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete2015
Other publications
hal-01239399v1
|
||
|
Computing a Complete Basis for Equalities Implied by a System of LRA Constraints14th International Workshop on Satisfiability Modulo Theories, 2016, Coimbra, Portugal. pp.15-30
Conference papers
hal-01403214v1
|
||
|
A Verified SAT Solver Framework with Learn, Forget, Restart, and IncrementalityIJCAI 2017 - 26th International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.4786-4790, ⟨10.24963/ijcai.2017/667⟩
Conference papers
hal-01592164v1
|
||
Linear Integer Arithmetic Revisited25th International Conference on Automated Deduction (CADE-25), Aug 2015, Berlin, Germany. pp.623-637
Conference papers
hal-01239394v1
|
|||
|
On the Expressivity and Applicability of Model Representation FormalismsFroCoS 2019 - 12th International Symposium on Frontiers of Combining Systems, 2019, London, United Kingdom. pp.22-39, ⟨10.1007/978-3-030-29007-8_2⟩
Conference papers
hal-02406605v1
|
||
|
SCL: Clause Learning from Simple Models27th International Conference on Automated Deduction, 2019, Natal, Brazil. pp.233-249, ⟨10.1007/978-3-030-29436-6_14⟩
Conference papers
hal-02405550v1
|
||
|
Generalized Completeness for SOS Resolution and its Application to a New Notion of RelevanceCADE 2021 - 28th International Conference on Automated Deduction, Jul 2021, Pittsburgh, PA / online, United States. pp.327-343, ⟨10.1007/978-3-030-79876-5_19⟩
Conference papers
hal-03516684v1
|
||
Automated Reasoning – Seventh International Joint Conference (IJCAR 2014)Stéphane Demri; Deepak Kapur; Christoph Weidenbach. 7th International Joint Conference - IJCAR 2014, Jun 2014, Vienna, Austria. 8562, Springer, 2014, LNCS - Lecture Notes in Computer Science, 978-3-319-08586-9. ⟨10.1007/978-3-319-08587-6⟩
Proceedings
hal-01098072v1
|
|||
|
A Rigorous Correctness Proof for PastryAbstract State Machines, Alloy, B, TLA, VDM, and Z - 5th International Conference, ABZ 2016, 2016, Linz, Austria. pp.86-101, ⟨10.1007/978-3-319-33600-8_5⟩
Conference papers
hal-01322342v1
|
||
|
A Verified SAT Solver Framework with Learn, Forget, Restart, and IncrementalityJournal of Automated Reasoning, 2018, 61 (1-4), pp.333-365. ⟨10.1007/s10817-018-9455-7⟩
Journal articles
hal-01904579v1
|
||
|
SPASS-SATT: A CDCL(LA) SolverCADE-27 - The 27th International Conference on Automated Deduction, Aug 2019, Natal, Brazil. pp.111-122, ⟨10.1007/978-3-030-29436-6_7⟩
Conference papers
hal-02405524v1
|
||
|
A complete and terminating approach to linear integer solvingJournal of Symbolic Computation, 2020, 100, pp.102-136. ⟨10.1016/j.jsc.2019.07.021⟩
Journal articles
hal-02397168v1
|
||
|
On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer ArithmeticCADE 26 - 26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden. pp.77-94, ⟨10.1007/978-3-319-63046-5_6⟩
Conference papers
hal-01592160v1
|
||
Automated Reasoning Building BlocksRoland Meyer and André Platzer and Heike Wehrheim. Correct System Design – Symposium in Honor of Ernst-Rüdiger Olderog, 9360, Springer, pp.172-188, 2015, ⟨10.1007/978-3-319-23506-6_12⟩
Book sections
hal-01239428v1
|
|||
|
Ordered Resolution with Straight Dismatching Constraints5th Workshop on Practical Aspects of Automated Reasoning (PAAR 2016), 2016, Coimbra, Portugal. pp.95-109
Conference papers
hal-01403206v1
|
||
|
Fast Cube Tests for LIA Constraint SolvingAutomated Reasoning - 8th International Joint Conference (IJCAR 2016), 2016, Coimbra, Portugal. pp.116-132, ⟨10.1007/978-3-319-40229-1_9⟩
Conference papers
hal-01403200v1
|
||
|
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Extended Abstract)Isabelle Workshop 2016, Aug 2016, Nancy, France
Conference papers
hal-01401807v1
|
||
|
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable2017
Preprints, Working Papers, ...
hal-01592177v1
|
||
|
A Verified SAT Solver Framework including Optimization and Partial ValuationsLPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, May 2020, Alicante, Spain. pp.212-193, ⟨10.29007/96wb⟩
Conference papers
hal-02963986v1
|
||
|
A Machine-Checked Correctness Proof for PastryScience of Computer Programming, 2018, 158, pp.64-80. ⟨10.1016/j.scico.2017.08.003⟩
Journal articles
hal-01768758v1
|