From post

First Results on How to Certify Subsumptions Computed by the EL Reasoner ELK Using the Logical Framework with Side Conditions.

, , и . Description Logics, том 2663 из CEUR Workshop Proceedings, CEUR-WS.org, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Splitting on Demand in SAT Modulo Theories., , , и . LPAR, том 4246 из Lecture Notes in Computer Science, стр. 512-526. Springer, (2006)The SMT-LIB Initiative and the Rise of SMT - (HVC 2010 Award Talk)., , , , и . Haifa Verification Conference, том 6504 из Lecture Notes in Computer Science, стр. 3. Springer, (2010)An Automatable Formal Semantics for IEEE-754 Floating-Point Arithmetic., , , и . ARITH, стр. 160-167. IEEE, (2015)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)., , и . J. ACM, 53 (6): 937-977 (2006)A Procedure for SyGuS Solution Fitting via Matching and Rewrite Rule Discovery., , , и . FMCAD, стр. 189-198. IEEE, (2023)CRV: Automated Cyber-Resiliency Reasoning for System Design Models., , , , , и . FMCAD, стр. 209-220. IEEE, (2023)An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types., , и . PDPAR/PaUL@FLoC, том 174 из Electronic Notes in Theoretical Computer Science, стр. 23-37. Elsevier, (2006)Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis., , , и . IJCAR (1), том 12166 из Lecture Notes in Computer Science, стр. 141-160. Springer, (2020)Syntax-Guided Rewrite Rule Enumeration for SMT Solvers., , , , , , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 279-297. Springer, (2019)Reasoning About Vectors Using an SMT Theory of Sequences., , , , , , , , , и . IJCAR, том 13385 из Lecture Notes in Computer Science, стр. 125-143. Springer, (2022)