# Logic in Computer Science

## Authors and titles for cs.LO in May 2012

[ total of 39 entries: 1-39 ]
[ showing up to 50 entries per page: fewer | more ]
[1]
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]
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]
Title: Modes of Convergence for Term Graph Rewriting
Authors: Patrick Bahr (Department of Computer Science, University of Copenhagen)
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]
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]
Title: Generalized Complexity of ALC Subsumption
Authors: Arne Meier
Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
[6]
Title: Pebble games with algebraic rules
Subjects: Logic in Computer Science (cs.LO)
[7]
Title: Constraint LTL Satisfiability Checking without Automata
Subjects: Logic in Computer Science (cs.LO)
[8]
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 &gt;= 4; everything else remains the same. From v1 to v2: Thm i is now Thm i-1 for i &gt;= 7, Corrected the proof of Theorem 10 (now Theorem 9) for B &gt; 2 (statement is still correct)
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[9]
Title: Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
Authors: Bas Luttik
Subjects: Logic in Computer Science (cs.LO)
[10]
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]
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]
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]
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]
Title: Untyping Typed Algebras and Colouring Cyclic Linear Logic
Authors: Damien Pous (CNRS)
Journal-ref: Logical Methods in Computer Science, Volume 8, Issue 2 (June 20, 2012) lmcs:718
Subjects: Logic in Computer Science (cs.LO)
[15]
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]
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]
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]
Title: Dynamic Logics of Dynamical Systems
Authors: André Platzer
Subjects: Logic in Computer Science (cs.LO); Dynamical Systems (math.DS); Logic (math.LO)
[19]
Title: An effective characterization of the alternation hierarchy in two-variable logic
Subjects: Logic in Computer Science (cs.LO)
[20]
Title: Applications of Quantified Constraint Solving over the Reals - Bibliography
Authors: Stefan Ratschan
Subjects: Logic in Computer Science (cs.LO)
[21]
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]
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]
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]
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]
Authors: Thomas Seiller
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[26]
Title: Interaction Graphs: Multiplicatives
Authors: Thomas Seiller
Comments: To appear in Annals of Pure and Applied Logic
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)
[27]
Title: Taming Past LTL and Flat Counter Systems
Subjects: Logic in Computer Science (cs.LO)
[28]
Title: Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
Subjects: Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL); Computer Science and Game Theory (cs.GT)
[29]  arXiv:1205.2051 (cross-list from cs.DC) [pdf, other]
Title: Weak Models of Distributed Computing, with Connections to Modal Logic
Comments: 1 + 40 pages, 9 figures
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Logic in Computer Science (cs.LO)
[30]  arXiv:1205.3663 (cross-list from cs.AI) [pdf, ps, other]
Title: The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
Subjects: Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)
[31]  arXiv:1205.5928 (cross-list from cs.DS) [pdf, other]
Title: An n log n Alogrithm for Deterministic Kripke Structure Minimization
Subjects: Data Structures and Algorithms (cs.DS); Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)
[32]  arXiv:1205.6346 (cross-list from cs.GT) [pdf, ps, other]
Title: On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Comments: 32 pages. Full version of the FoSSaCS 2012 proceedings paper
Journal-ref: Logical Methods in Computer Science, Volume 9, Issue 1 (February 28, 2013) lmcs:790
Subjects: Computer Science and Game Theory (cs.GT); Logic in Computer Science (cs.LO)
[33]  arXiv:1205.6527 (cross-list from cs.PL) [pdf, ps, other]
Title: Towards Bounded Infeasible Code Detection
Subjects: Programming Languages (cs.PL); Logic in Computer Science (cs.LO)
[34]  arXiv:1205.1775 (cross-list from math.LO) [pdf, ps, other]
Title: Automatic Ordinals
Authors: Olivier Finkel (ELM, IMJ), Stevo Todorcevic (ELM, IMJ)
Comments: To appear in a Special Issue on New Worlds of Computation 2011 of the International Journal of Unconventional Computing. arXiv admin note: text overlap with arXiv:1111.1504
Journal-ref: International Journal of Unconventional Computing 9, 1-2 (2013) 61-70
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO)
[35]  arXiv:1205.2187 (cross-list from quant-ph) [pdf, other]
Title: Model checking quantum Markov chains
Journal-ref: Journal of Computer and System Sciences 2013, 79, 1181-1198
Subjects: Quantum Physics (quant-ph); Logic in Computer Science (cs.LO)
[36]  arXiv:1205.2554 (cross-list from math.LO) [pdf, ps, other]
Title: On existential declarations of independence in IF Logic
Authors: Fausto Barbero
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO)
[37]  arXiv:1205.3050 (cross-list from math.CT) [pdf, ps, other]
Title: Operads, clones, and distributive laws
Authors: Pierre-Louis Curien (PPS, INRIA Paris - Rocquencourt)
Subjects: Category Theory (math.CT); Logic in Computer Science (cs.LO); K-Theory and Homology (math.KT)
[38]  arXiv:1205.3940 (cross-list from math.LO) [pdf, ps, other]
Title: New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic
Authors: Bart Jacobs (Institute for Computing and Information Sciences (iCIS), Radboud University Nijm)
Journal-ref: Logical Methods in Computer Science, Volume 11, Issue 3 (October 1, 2015) lmcs:1600
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO); Quantum Physics (quant-ph)
[39]  arXiv:1205.4316 (cross-list from math.LO) [pdf, other]
Title: A simplified framework for first-order languages and its formalization in Mizar
Comments: Ph.D. thesis, defended on January, 20th, 2012
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO)
[ total of 39 entries: 1-39 ]
[ showing up to 50 entries per page: fewer | more ]

Disable MathJax (What is MathJax?)