Filter your results
- 32
- 29
- 42
- 9
- 4
- 2
- 2
- 1
- 1
- 4
- 60
- 1
- 1
- 1
- 2
- 4
- 4
- 4
- 7
- 3
- 6
- 5
- 3
- 2
- 5
- 3
- 4
- 1
- 3
- 3
- 1
- 60
- 1
- 60
- 48
- 39
- 12
- 8
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 61
- 14
- 12
- 8
- 7
- 6
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
61 Results
Practical Proof Reconstruction for First-order Logic and Set-Theoretical ConstructionsThe Isabelle Workshop 2007 - Isabelle'07, Jul 2007, Bremen, Germany. pp.2-13
Conference papers
inria-00186638v1
|
|||
Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging FunctionsWorkshop on Automated Deduction: Decidability, Complexity, Tractability, ADDCT 2014. Held as Part of the Vienna Summer of Logic, affiliated with IJCAR 2014 and RTA 2014, Silvio Ghilardi, Ulrike Sattler, Viorica Sofronie-Stokkermans, Jul 2014, Vienna, Austria
Conference papers
hal-01087218v1
|
|||
|
Polite Combination of Algebraic DatatypesJournal of Automated Reasoning, 2022, 66 (3), pp.331-355. ⟨10.1007/s10817-022-09625-3⟩
Journal articles
hal-03853159v1
|
||
|
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMTSC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom
Conference papers
hal-01946733v1
|
||
Decision Procedures for the Formal Analysis of Software3rd International Colloquium on Theoretical Aspects of Computing, ICTAC, Nov 2006, Tunis, Tunisia, pp.366--370, ⟨10.1007/11921240_26⟩
Conference papers
istex
inria-00117277v1
|
|||
Compression of Propositional Resolution Proofs via Partial Regularization23rd International Conference on Automated Deduction - CADE-23, Jul 2011, Wroclaw, Poland. pp.237-251, ⟨10.1007/978-3-642-22438-6_19⟩
Conference papers
istex
inria-00617846v1
|
|||
Combining theories: the Ackerman and Guarded Fragments8th International Symposium Frontiers of Combining Systems - FroCoS 2011, Viorica Sofronie-Stokkermans, Oct 2011, Saarbrücken, Germany. pp.40--54, ⟨10.1007/978-3-642-24364-6_4⟩
Conference papers
istex
hal-00642529v1
|
|||
|
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems - TACAS'06, Mar 2006, Vienna/Austria, pp.167-181, ⟨10.1007/11691372_11⟩
Conference papers
inria-00001088v1
|
||
Automating model-based software engineeringColloque d'Informatique: Brésil/INRIA (COLIBRI), Jul 2009, Bento Gonçalves, Brazil. pp.22-27
Conference papers
inria-00430637v1
|
|||
|
Combining decision procedures by (model-)equality propagationScience of Computer Programming, 2010, 240 (2 July 2009), pp.113-128. ⟨10.1016/j.entcs.2009.05.048⟩
Journal articles
inria-00543801v1
|
||
|
Quantifier Inference Rules for SMT proofsFirst International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wrocław, Poland
Conference papers
hal-00642535v1
|
||
SyMT: finding symmetries in SMT formulas11th International Workshop on Satisfiability Modulo Theories - SMT, Jul 2013, Helsinki, Finland
Conference papers
hal-00867816v1
|
|||
|
A Gentle Non-Disjoint Combination of Satisfiability Procedures (Extended Version)[Research Report] RR-8529, INRIA. 2014
Reports
hal-00985135v1
|
||
|
Politeness and Combination Methods for Theories with Bridging FunctionsJournal of Automated Reasoning, 2020, 64, pp.97-134. ⟨10.1007/s10817-019-09512-4⟩
Journal articles
hal-01988452v1
|
||
|
Machine Learning for Instance Selection in SMT SolvingAITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria
Conference papers
hal-02381430v1
|
||
Combination of disjoint theories: beyond decidabilityIJCAR - 6th International Joint Conference on Automated Reasoning - 2012, Jun 2012, Manchester, United Kingdom. pp.256-270, ⟨10.1007/978-3-642-31365-3_21⟩
Conference papers
hal-00747271v1
|
|||
|
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited25th International Conference on Automated Deduction, CADE-25, Christoph Benzmueller, Aug 2015, Berlin, Germany. pp.419-433, ⟨10.1007/978-3-319-21401-6_29⟩
Conference papers
hal-01157898v1
|
||
haRVey : satisfaisabilité et théoriesApproches Formelles dans l'Assistance au Développement de Logiciels - AFADL'07, Jun 2007, Namur, Belgique. pp.287-288
Conference papers
inria-00186640v1
|
|||
Computing prime implicants13th International Conference on Formal Methods in Computer-Aided Design (FMCAD'13), Oct 2013, Portland, Oregon, United States. pp.46-52, ⟨10.1109/FMCAD.2013.6679390⟩
Conference papers
hal-03300802v1
|
|||
|
Satisfiability Checking and Symbolic ComputationACM Communications in Computer Algebra, 2016, 50 (4), pp.145-147. ⟨10.1145/3055282.3055285⟩
Journal articles
hal-01648695v1
|
||
|
NP-completeness of small conflict set generation for congruence closureFormal Methods in System Design, 2017, 51 (3), pp.533 - 544. ⟨10.1007/s10703-017-0283-x⟩
Journal articles
hal-01908684v1
|
||
Integrating SMT solvers in RodinScience of Computer Programming, 2014, Abstract State Machines, Alloy, B, VDM, and Z — Selected and extended papers from ABZ 2012, 94, pp.14
Journal articles
hal-01094999v1
|
|||
|
Revisiting Enumerative InstantiationTACAS 2018 - 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2018, Thessaloniki, Greece. pp.20
Conference papers
hal-01877055v1
|
||
veriT: an open, trustable and efficient SMT-solver22nd International Conference on Automated Deduction - CADE 22, Aug 2009, Montreal, Canada. pp.151-156, ⟨10.1007/978-3-642-02959-2_12⟩
Conference papers
istex
inria-00430634v1
|
|||
Exploiting Symmetry in SMT ProblemsInternational Conference on Automated Deduction (CADE), Jul 2011, Wroclaw, Poland. pp.222-236, ⟨10.1007/978-3-642-22438-6_18⟩
Conference papers
istex
inria-00617843v1
|
|||
GridTPT: a distributed platform for Theorem Prover Testing2nd Workshop on Practical Aspects of Automated Reasoning (PAAR), Jul 2010, Edinburgh, United Kingdom
Conference papers
inria-00543805v1
|
|||
|
Scalable Fine-Grained Proofs for Formula Processing[Research Report] Universite de Lorraine, CNRS, Inria, LORIA, Nancy, France; Universidade Federal do Rio Grande do Norte, Natal, Brazil; Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2017, pp.25
Reports
hal-01526841v1
|
||
|
Congruence Closure with Free Variables[Research Report] Inria, Loria, Universite de Lorraine, UFRN, University of Iowa. 2017
Reports
hal-01442691v2
|
||
|
Exploring and Exploiting Algebraic and Graphical Properties of Resolution8th International Workshop on Satisfiability Modulo Theories - SMT 2010, Jul 2010, Edinburgh, United Kingdom
Conference papers
inria-00544658v1
|
||
SMT solvers for RodinABZ - Third International Conference on Abstract State Machines, Alloy, B, VDM, and Z - 2012, Jun 2012, Pisa, Italy. pp.194-207, ⟨10.1007/978-3-642-30885-7_14⟩
Conference papers
hal-00747269v1
|