Facet browsing currently unavailable
Page 3 of 751 results
Sort by: relevance publication year
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus JOURNAL ARTICLE published 28 March 2024 in ACM Transactions on Computational Logic |
Comprehending software correctness implies comprehending an intelligence-related limitation JOURNAL ARTICLE published July 2006 in ACM Transactions on Computational Logic |
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 |
A decomposition-based implementation of search strategies JOURNAL ARTICLE published April 2004 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 5 February 2019 in ACM Transactions on Computational Logic |
Metric Temporal Description Logics with Interval-Rigid Names JOURNAL ARTICLE published 31 October 2020 in ACM Transactions on Computational Logic Research funded by GOASQ (BA 1122/19-1) | Cluster of Excellence “Center forAdvancing Electronics Dresden” (389792660) |
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction JOURNAL ARTICLE published 28 March 2016 in ACM Transactions on Computational Logic Research funded by Air Force Office of Scientific Research (FA9550-09-1-0596) | EU Seventh Framework Programme (PIOF-GA-2011-301166, DATAVERIF) | National Science Foundation (0644299) |
JOURNAL ISSUE published 1 January 2011 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 1 January 2009 in ACM Transactions on Computational Logic |
Decidability of a Sound Set of Inference Rules for Computational Indistinguishability JOURNAL ARTICLE published 31 January 2021 in ACM Transactions on Computational Logic Research funded by French National Research Agency (ANR-17-CE39-0004-01) |
A PSPACE-complete first-order fragment of computability logic JOURNAL ARTICLE published February 2014 in ACM Transactions on Computational Logic |