Cs-Lo
Herbrand Consistency of Some Finite Fragments of Bounded Arithmetical Theories
From Total Assignment Enumeration to Modern SAT Solver
Formal Verification of an Iterative Low-Power x86 Floating-Point Multiplier with Redundant Feedback
Formal verification of a deadlock detection algorithm
Computability, G"odels Incompleteness Theorem, and an inherent limit on the predictability of evolution
Trichromatic Open Digraphs for Understanding Qubits
Event-Clock Automata: From Theory to Practice
Towards a Calculus of Object Programs
Algorithms for Synthesizing Priorities in Component-based Systems
Termination in a Pi-calculus with Subtyping
Homotopies in Classical and Paraconsistent Modal Logics
On Combining Linear-Based Strategies for Tabled Evaluation of Logic Programs
The parallel versus branching recurrences in computability logic
HYPE with stochastic events
Functions as proofs as processes
Finite countermodels for safety verification of parameterized tree systems
Some Non-Classical Approaches to the Branderburger-Keisler Paradox
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language
A Survey on how Description Logic Ontologies Benefit from Formal Concept Analysis
Infinitary Term Graph Rewriting
Higher Order Programming to Mine Knowledge for a Modern Medical Expert System
