We gratefully acknowledge support from
the Simons Foundation
and member institutions

Logic in Computer Science

Authors and titles for cs.LO in May 2012

[ total of 39 entries: 1-25 | 26-39 ]
[ showing 25 entries per page: fewer | more | all ]
[1]  arXiv:1205.0126 [pdf, ps, other]
Title: On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Authors: Matteo Mio (LIX, Ecole Polytechnique)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 1, 2012) lmcs:787
Subjects: Logic in Computer Science (cs.LO)
[2]  arXiv:1205.0139 [pdf, other]
Title: $λ$-Scale, a lambda calculus for spaces with dilations
Authors: Marius Buliga
Comments: massively re-written version, condensed, relative calculus introduced
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO); Metric Geometry (math.MG); Rings and Algebras (math.RA)
[3]  arXiv:1205.0357 [pdf, ps, other]
Title: Modes of Convergence for Term Graph Rewriting
Authors: Patrick Bahr (Department of Computer Science, University of Copenhagen)
Comments: arXiv admin note: substantial text overlap with arXiv:1107.0666
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 1, 2012) lmcs:935
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[4]  arXiv:1205.0679 [pdf, ps, other]
Title: Lower Bounds for Existential Pebble Games and k-Consistency Tests
Authors: Christoph Berkholz (RWTH Aachen University)
Journal-ref: Logical Methods in Computer Science, Volume 9, Issue 4 (October 8, 2013) lmcs:1010
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
[5]  arXiv:1205.0722 [pdf, other]
Title: Generalized Complexity of ALC Subsumption
Authors: Arne Meier
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
[6]  arXiv:1205.0913 [pdf, ps, other]
Title: Pebble games with algebraic rules
Subjects: Logic in Computer Science (cs.LO)
[7]  arXiv:1205.0946 [pdf, other]
Title: Constraint LTL Satisfiability Checking without Automata
Comments: 39 pages
Subjects: Logic in Computer Science (cs.LO)
[8]  arXiv:1205.1358 [pdf, ps, other]
Title: Preservation under Substructures modulo Bounded Cores
Comments: From v2 to v3: Corrected typos, edited sentences for better readability; Conjecture 1 of v2 is now resolved so it is now Theorem 4, its proof is included in a new section (Section 7), Thm i in v2 is now Thm i+1 for i >= 4; everything else remains the same. From v1 to v2: Thm i is now Thm i-1 for i >= 7, Corrected the proof of Theorem 10 (now Theorem 9) for B > 2 (statement is still correct)
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[9]  arXiv:1205.2117 [pdf, ps, other]
Title: Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
Authors: Bas Luttik
Subjects: Logic in Computer Science (cs.LO)
[10]  arXiv:1205.2492 [pdf, ps, other]
Title: Refining Inductive Types
Authors: Robert Atkey (University of Strathclyde), Patricia Johann (University of Strathclyde), Neil Ghani (University of Strathclyde)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 4, 2012) lmcs:957
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[11]  arXiv:1205.2519 [pdf, other]
Title: Dynamic Dependency Pairs for Algebraic Functional Systems
Authors: Cynthia Kop (VU University Amsterdam), Femke van Raamsdonk (VU University Amsterdam)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 19, 2012) lmcs:668
Subjects: Logic in Computer Science (cs.LO)
[12]  arXiv:1205.2644 [pdf]
Title: First-Order Mixed Integer Linear Programming
Comments: Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009)
Subjects: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI)
[13]  arXiv:1205.2931 [pdf, ps, other]
Title: Precompact Apartness Spaces
Authors: Douglas S Bridges (University of Canterbury)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 25, 2012) lmcs:1052
Subjects: Logic in Computer Science (cs.LO); General Topology (math.GN)
[14]  arXiv:1205.3612 [pdf, other]
Title: Untyping Typed Algebras and Colouring Cyclic Linear Logic
Authors: Damien Pous (CNRS)
Comments: 21p
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 20, 2012) lmcs:718
Subjects: Logic in Computer Science (cs.LO)
[15]  arXiv:1205.3758 [pdf, ps, other]
Title: Invariant stream generators using automatic abstract transformers based on a decidable logic
Subjects: Logic in Computer Science (cs.LO); Software Engineering (cs.SE)
[16]  arXiv:1205.3803 [pdf, ps, other]
Title: Necessity as justified truth
Authors: Steffen Lewitzka
Comments: 36 pages; corrected typos from the first version; content and results remain completely unchanged
Subjects: Logic in Computer Science (cs.LO)
[17]  arXiv:1205.4691 [pdf, ps, other]
Title: On the discriminating power of tests in resource lambda-calculus
Authors: Flavien Breuvart (PPS)
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[18]  arXiv:1205.4788 [pdf, ps, other]
Title: Dynamic Logics of Dynamical Systems
Authors: André Platzer
Subjects: Logic in Computer Science (cs.LO); Dynamical Systems (math.DS); Logic (math.LO)
[19]  arXiv:1205.4802 [pdf, ps, other]
Title: An effective characterization of the alternation hierarchy in two-variable logic
Subjects: Logic in Computer Science (cs.LO)
[20]  arXiv:1205.5571 [pdf, ps, other]
Title: Applications of Quantified Constraint Solving over the Reals - Bibliography
Authors: Stefan Ratschan
Subjects: Logic in Computer Science (cs.LO)
[21]  arXiv:1205.5745 [pdf, ps, other]
Title: Generic Expression Hardness Results for Primitive Positive Formula Comparison
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC); Databases (cs.DB)
[22]  arXiv:1205.5838 [pdf, other]
Title: ExpTime Tableaux for the Description Logic SHIQ Based on Global State Caching and Integer Linear Feasibility Checking
Authors: Linh Anh Nguyen
Subjects: Logic in Computer Science (cs.LO)
[23]  arXiv:1205.6192 [pdf, ps, other]
Title: Markov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States
Comments: Main results stay the same as in the previous versions, but the proofs have completely changed
Subjects: Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL)
[24]  arXiv:1205.6402 [pdf, other]
Title: Constructive Provability Logic
Comments: Extended version of IMLA 2011 submission of the same title
Subjects: Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
[25]  arXiv:1205.6557 [pdf, ps, other]
Title: Interaction Graphs: Additives
Authors: Thomas Seiller
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[ total of 39 entries: 1-25 | 26-39 ]
[ showing 25 entries per page: fewer | more | all ]

Disable MathJax (What is MathJax?)