( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New results on rewrite-based satisfiability procedures.

, , , и . ACM Trans. Comput. Log., 10 (1): 4:1-4:51 (2009)

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.

Maria Paola Santini

Maria-Paola Bottino

Paola Maria Brunello

Maria-Paola Lombardo

Claudio Bonacina

 

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

Distributed Deduction by Clause-Diffusion: The Aquarius Prover., и . DISCO, том 722 из Lecture Notes in Computer Science, стр. 272-287. Springer, (1993)On Interpolation in Decision Procedures., и . TABLEAUX, том 6793 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2011)On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal., , , и . FroCoS, том 3717 из Lecture Notes in Computer Science, стр. 65-80. Springer, (2005)Conflict-Driven Satisfiability for Theory Combination: Transition System and Completeness., , и . J. Autom. Reason., 64 (3): 579-609 (2020)Six Decades of Automated Reasoning: Papers in Memory of Larry Wos.. J. Autom. Reason., 66 (4): 437-438 (2022)On Deciding Satisfiability by Theorem Proving with Speculative Inferences., , и . J. Autom. Reason., 47 (2): 161-189 (2011)Proof Generation in CDSAT.. PxTP, том 336 из EPTCS, стр. 1-4. (2021)Satisfiability Modulo Theories and Assignments., , и . CADE, том 10395 из Lecture Notes in Computer Science, стр. 42-59. Springer, (2017)Automated Reasoning for Explainable Artificial Intelligence.. ARCADE@CADE, том 51 из EPiC Series in Computing, стр. 24-28. EasyChair, (2017)A System for Distributed Simplification-Based Theorem Proving., и . Dagstuhl Seminar on Parallelization in Inference Systems, том 590 из Lecture Notes in Computer Science, стр. 370. Springer, (1990)