Facet browsing currently unavailable
Page 2 of 751 results
Sort by: relevance publication year
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation JOURNAL ARTICLE published 31 January 2023 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 1 July 2007 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 24 March 2015 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 1 January 2007 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 28 March 2016 in ACM Transactions on Computational Logic |
Propositional computability logic II JOURNAL ARTICLE published April 2006 in ACM Transactions on Computational Logic |
Proof-complexity results for nonmonotonic reasoning JOURNAL ARTICLE published July 2001 in ACM Transactions on Computational Logic |
Automated Verification of Equivalence Properties of Cryptographic Protocols JOURNAL ARTICLE published 15 November 2016 in ACM Transactions on Computational Logic Research funded by European Research Council (645865-SPOOC) | Agence Nationale de la Recherche (ANR-11-JS02-006) | European Sectorial Operational Programme Human Resource Development (POSDRU/159/1.5/S/137750) | National Science Foundation (1314338) |
A General Theory of Barbs, Contexts, and Labels JOURNAL ARTICLE published August 2014 in ACM Transactions on Computational Logic |
A proof theory for generic judgments JOURNAL ARTICLE published October 2005 in ACM Transactions on Computational Logic |
JOURNAL ISSUE published 1 January 2011 in ACM Transactions on Computational Logic |
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 22 July 2016 in ACM Transactions on Computational Logic |
Probabilistic agent programs JOURNAL ARTICLE published October 2000 in ACM Transactions on Computational Logic |
Inputs, Outputs, and Composition in the Logic of Information Flows JOURNAL ARTICLE published 31 October 2023 in ACM Transactions on Computational Logic Research funded by Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” programme (G0D9616N) | National Natural Science Foundation of China (61972455) | Special Research Fund (BOF19OWB16) |
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) |
Taming Paraconsistent (and Other) Logics JOURNAL ARTICLE published March 2015 in ACM Transactions on Computational Logic Research funded by Israel Science Foundation (280-10) |
Computing persistent homology within Coq/SSReflect JOURNAL ARTICLE published November 2013 in ACM Transactions on Computational Logic |