Showing 21–40 of 40 results
/ Date/ Name
Dec 22, 2021A Simplicity Bubble Problem in Formal-Theoretic Learning SystemsSep 20, 2021A Flexible Proof Format for SAT Solver-Elaborator CommunicationMay 31, 2021An Automated Approach to the Collatz ConjectureMay 3, 2021Generating Extended Resolution Proofs with a BDD-Based SAT SolverMar 18, 2021Exploiting Isomorphic Subgraphs in SAT (Long version)Sep 23, 2020Emergence of complex data from simple local rules in a network gameSep 2, 2020On the existence of hidden machines in computational time hierarchiesJan 7, 2020Lifting with Simple Gadgets and Applications to Circuit and Proof ComplexityAug 31, 2019Conditions for Unnecessary Logical Constraints in Kernel MachinesJul 26, 2019T-Norms Driven Loss Functions for Machine LearningMay 13, 2019Transtemporal edges and crosslayer edges in incompressible high-order networksMar 27, 2019Local Search for Fast Matrix MultiplicationSep 18, 2018On a Convex Logic Fragment for Learning and ReasoningOct 30, 2017The univalence axiom in cubical setsDec 21, 2015Constrained Sampling and Counting: Universal Hashing Meets SAT SolvingApr 29, 2015Hydras: Directed Hypergraphs and Horn FormulasMar 25, 2014Non-characterizability of belief revision: an application of finite model theoryFeb 5, 2014Breaking a monad-comonad symmetry between computational effectsOct 2, 2013Formal verification in Coq of program properties involving the global state effectSep 10, 2013Enumeration of the adjunctive hierarchy of hereditarily finite sets