Sign in
Facet browsing currently unavailable
Page 4 of 751 results
Sort by: relevance publication year
|
1-Safe Petri Nets and Special Cube Complexes JOURNAL ARTICLE published 31 July 2019 in ACM Transactions on Computational Logic Research funded by ANR Project DISTANCIA (ANR-17-CE40-0015) |
|
Belief Merging by Examples JOURNAL ARTICLE published 28 March 2016 in ACM Transactions on Computational Logic |
|
Regular tree languages definable in FO and in FO mod JOURNAL ARTICLE published October 2009 in ACM Transactions on Computational Logic |
|
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Computational Logic Research funded by Polish National Science Centre (DEC-2013/09/B/ST6/01535) |
|
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies JOURNAL ARTICLE published 15 November 2016 in ACM Transactions on Computational Logic Research funded by John Templeton Foundation (20517) |
|
On the Decidability of Elementary Modal Logics JOURNAL ARTICLE published 10 December 2015 in ACM Transactions on Computational Logic Research funded by Austrian Science Fund (FWF)NFN (S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award)) | Polish National Science Center (DEC-2011/03/N/ST6/00415,DEC-2013/09/B/ST6/01535) | European Research Council (267989 (QUAREM)) |
|
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Computational Logic |
|
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields JOURNAL ARTICLE published 31 January 2022 in ACM Transactions on Computational Logic |
|
On Proof Complexity of Resolution over Polynomial Calculus JOURNAL ARTICLE published 31 July 2022 in ACM Transactions on Computational Logic Research funded by GACR (19-27871X) | institute Grant RVO (67985840) | Specific university research (SVV-2020-260589) |
|
Toward a Uniform Theory of Effectful State Machines JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Computational Logic Research funded by Deutsche Forschungsgemeinschaft (GO 2161/1-2, MI 717/5-1) |
|
Compilability and compact representations of revision of Horn knowledge bases JOURNAL ARTICLE published July 2000 in ACM Transactions on Computational Logic |
|
Probabilistic Epistemic Updates on Algebras JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Computational Logic Research funded by NWO (016.138.314) |
|
Erratum for “What causes a system to satisfy a specification?” JOURNAL ARTICLE published July 2010 in ACM Transactions on Computational Logic |
|
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement JOURNAL ARTICLE published October 2002 in ACM Transactions on Computational Logic |
|
The tractability of model checking for LTL JOURNAL ARTICLE published January 2011 in ACM Transactions on Computational Logic Research funded by Deutsche Forschungsgemeinschaft (630/6-1) |
|
Are Short Proofs Narrow? QBF Resolution Is Not So Simple JOURNAL ARTICLE published 31 January 2018 in ACM Transactions on Computational Logic Research funded by EU Marie Curie IRSES grant CORCON (48138) | John Templeton Foundation, EPSRC (EP/L024233/1) |
|
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties JOURNAL ARTICLE published December 2007 in ACM Transactions on Computational Logic |
|
Proofs, tests and continuation passing style JOURNAL ARTICLE published February 2009 in ACM Transactions on Computational Logic |
|
Ordinary interactive small-step algorithms, III JOURNAL ARTICLE published July 2007 in ACM Transactions on Computational Logic |
|
Deciding strategy properties of contract-signing protocols JOURNAL ARTICLE published May 2010 in ACM Transactions on Computational Logic Research funded by Deutsche Forschungsgemeinschaft (KU 1434/4-2KU 1434/5-1) | Swiss National Science Foundation (200021-116596) |