Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Daniel El Ouraoui"'
Autor:
Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 262, Iss Proc. PxTP 2017, Pp 15-22 (2017)
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little
Externí odkaz:
https://doaj.org/article/8def77b0317f4fa99f881de2fb4f1e55
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030294359
CADE
CADE-27-The 27th International Conference on Automated Deduction
CADE-27-The 27th International Conference on Automated Deduction, Aug 2019, Natal, Brazil. pp.35-54, ⟨10.1007/978-3-030-29436-6_3⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Deduction – CADE 27
Automated Deduction – CADE 27-27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings
CADE
CADE-27-The 27th International Conference on Automated Deduction
CADE-27-The 27th International Conference on Automated Deduction, Aug 2019, Natal, Brazil. pp.35-54, ⟨10.1007/978-3-030-29436-6_3⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Deduction – CADE 27
Automated Deduction – CADE 27-27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings
International audience; SMT solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic (FOL). In contrast, the extension of SMT solvers to higher-order logic (HOL) is mostly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b775c7de42d0e932ff48e22adefaad6b
https://doi.org/10.1007/978-3-030-29436-6_3
https://doi.org/10.1007/978-3-030-29436-6_3
Autor:
Daniel El Ouraoui, Pascal Fontaine, Simon Cruanes, Haniel Barbosa, Jasmin Christian Blanchette
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, 262(262), 15-22. Open Publishing Association
Electronic Proceedings in Theoretical Computer Science
Electronic Proceedings in Theoretical Computer Science, Vol 262, Iss Proc. PxTP 2017, Pp 15-22 (2017)
Barbosa, H, Blanchette, J C, Cruanes, S, El Ouraoui, D & Fontaine, P 2017, ' Language and Proofs for Higher-Order SMT (Work in Progress) ', Electronic Proceedings in Theoretical Computer Science, vol. 262, no. 262, pp. 15-22 . https://doi.org/10.4204/EPTCS.262.3
PxTP
Electronic Proceedings in Theoretical Computer Science
Electronic Proceedings in Theoretical Computer Science, Vol 262, Iss Proc. PxTP 2017, Pp 15-22 (2017)
Barbosa, H, Blanchette, J C, Cruanes, S, El Ouraoui, D & Fontaine, P 2017, ' Language and Proofs for Higher-Order SMT (Work in Progress) ', Electronic Proceedings in Theoretical Computer Science, vol. 262, no. 262, pp. 15-22 . https://doi.org/10.4204/EPTCS.262.3
PxTP
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5febcbb470d25ba8c6b33c2b236ef7ed
http://arxiv.org/abs/1712.01486
http://arxiv.org/abs/1712.01486
Publikováno v:
AITP 2019-4th Conference on Artificial Intelligence and Theorem Proving
AITP 2019-4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria
AITP 2019-4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria
International audience; SMT solvers are among the most suited tools for quantifier-free first-order problems, and their support for quantified formulas has been improving in recent years. To instantiate quantifiers, they rely on heuristic techniques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e34723f41627a3ef68b336cbca75699d
https://hal.archives-ouvertes.fr/hal-02381430/document
https://hal.archives-ouvertes.fr/hal-02381430/document