-
1Conference
Authors: Vialard, Isa
Contributors: Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), ANR-17-CE40-0028,BRAVAS,IDEAL-BASED ALGORITHMS FOR VASSES AND WELL-STRUCTURED SYSTEMS(2017)
Source: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩
Subject Terms: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Logic and verification, Theory of computation → Proof theory, Theory of computation → Program reasoning, finite multisets, termination, program verification, Well-partial order, [INFO]Computer Science [cs]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881
-
2Conference
Authors: Mengel, Stefan
Contributors: Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), Meel, Kuldeep S. and Strichman, Ofer, Meel, Kuldeep S. and Strichman, Ofer, ANR-18-CE40-0011,PING-ACK,Pré-traitement d'informations pour la résolution de tâches complexes / Compilation avancée de connaissances(2018)
Source: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
https://hal.science/hal-03864946
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩Subject Terms: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Proof complexity phrases rectangle decision lists, QBF proof complexity, OBDD, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]