Electronic Notes in Theoretical Computer Science, Volume 269
Volume 269, April 2011
- Natarajan Shankar, Marc Vaucher: The Mechanical Verification of a DPLL-Based Satisfiability Solver. 3-17
- Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira: The Functional Interpretation of Direct Computations. 19-40
- Flávio L. C. de Moura, A. V. Barbosa, Mauricio Ayala-Rincón, Fairouz Kamareddine: A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi. 41-54
- Rafael del Vado Vírseda: A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains. 55-69
- Cibele Matos Freire, Ana Teresa C. Martins: The Descriptive Complexity of the Deterministic Exponential Time Hierarchy. 71-82
- Valeria de Paiva: Bridges from Language to Logic: Concepts, Contexts and Ontologies. 83-94
- Mario R. F. Benevides, Renata P. de Freitas, Jorge Petrúcio Viana: Propositional Dynamic Logic with Storing, Recovering and Parallel Composition. 95-107
- Vivek Nigam, Elaine Pimentel, Giselle Reis: Specifying Proof Systems in Linear Logic with Subexponentials. 109-123
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team