Search results for "CSL"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Jérôme Fortier, Luigi Santocanale	Cuts for circular proofs: semantics and cut-elimination.	CSL	2013	DBLP DOI BibTeX RDF
1	Jean-Yves Girard 0001	Three lightings of logic (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
1	Stefan Göller	The Fixed-Parameter Tractability of Model Checking Concurrent Systems.	CSL	2013	DBLP DOI BibTeX RDF
1	Dexter Kozen, Konstantinos Mamouras	Kleene Algebra with Products and Iteration Theories.	CSL	2013	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov, Víctor Dalmau, Marc Thurley	Descriptive complexity of approximate counting CSPs.	CSL	2013	DBLP DOI BibTeX RDF
1	Christopher H. Broadbent, Naoki Kobayashi 0001	Saturation-Based Model Checking of Higher-Order Recursion Schemes.	CSL	2013	DBLP DOI BibTeX RDF
1	Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu	Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic.	CSL	2013	DBLP DOI BibTeX RDF
1	Simona Ronchi Della Rocca (eds.)	Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy	CSL	2013	DBLP BibTeX RDF
1	Kaveh Ghasemloo, Stephen A. Cook	Theories for Subexponential-size Bounded-depth Frege Proofs.	CSL	2013	DBLP DOI BibTeX RDF
1	Qian Wang, Bruno Barras	Semantics of Intensional Type Theory extended with Decidable Equational Theories.	CSL	2013	DBLP DOI BibTeX RDF
1	Isabel Oitavem	From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
1	Johannes Schmidt 0001, Michal Wrona	The Complexity of Abduction for Equality Constraint Languages.	CSL	2013	DBLP DOI BibTeX RDF
1	Yoshihiro Maruyama	Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad.	CSL	2013	DBLP DOI BibTeX RDF
1	Stéphane Gimenez, Georg Moser	The Structure of Interaction.	CSL	2013	DBLP DOI BibTeX RDF
1	Neelakantan R. Krishnaswami, Derek Dreyer	Internalizing Relational Parametricity in the Extensional Calculus of Constructions.	CSL	2013	DBLP DOI BibTeX RDF
1	Marek Materzok	Axiomatizing Subtyped Delimited Continuations.	CSL	2013	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol	What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.	CSL	2013	DBLP DOI BibTeX RDF
1		Frontmatter, Table of Contents, Preface, Conference Organization.	CSL	2013	DBLP DOI BibTeX RDF
1	Lionel Rieg	Extracting Herbrand trees in classical realizability using forcing.	CSL	2013	DBLP DOI BibTeX RDF
1	Pietro Galliani, Miika Hannula, Juha Kontinen	Hierarchies in independence logic.	CSL	2013	DBLP DOI BibTeX RDF
1	Lidia Tendera	Means and Limits of Decision (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
1	Bahareh Afshari, Graham E. Leigh	On closure ordinals for the modal mu-calculus.	CSL	2013	DBLP DOI BibTeX RDF
1	Anuj Dawar, Thomas A. Henzinger, Damian Niwinski	The Ackermann Award 2013.	CSL	2013	DBLP DOI BibTeX RDF
1	Christoph Berkholz, Andreas Krebs, Oleg Verbitsky 0001	Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy.	CSL	2013	DBLP DOI BibTeX RDF
1	Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo	Towards CERes in intuitionistic logic.	CSL	2012	DBLP DOI BibTeX RDF
1	Zhilin Wu	Commutative Data Automata.	CSL	2012	DBLP DOI BibTeX RDF
1	Nathalie Bertrand 0001, John Fearnley, Sven Schewe	Bounded Satisfiability for PCTL.	CSL	2012	DBLP DOI BibTeX RDF
1	Thorsten Altenkirch, Ondrej Rypacek	A Syntactical Approach to Weak omega-Groupoids.	CSL	2012	DBLP DOI BibTeX RDF
1	Jacek Chrzaszcz, Aleksy Schubert	ML with PTIME complexity guarantees.	CSL	2012	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Michal Wrona	Equivalence Constraint Satisfaction Problems.	CSL	2012	DBLP DOI BibTeX RDF
1	Emanuel Kieronski, Jakub Michaliszyn	Two-Variable Universal Logic with Transitive Closure.	CSL	2012	DBLP DOI BibTeX RDF
1		Frontmatter, Table of Contents, Preface, Conference Organization.	CSL	2012	DBLP DOI BibTeX RDF
1	Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho	Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication.	CSL	2012	DBLP DOI BibTeX RDF
1	Stefano Berardi, Ugo de'Liguoro	Knowledge Spaces and the Completeness of Learning Strategies.	CSL	2012	DBLP DOI BibTeX RDF
1	Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn	Bounded Combinatory Logic.	CSL	2012	DBLP DOI BibTeX RDF
1	Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa	Definability of linear equation systems over groups and rings.	CSL	2012	DBLP DOI BibTeX RDF
1	Inês Lynce	Satisfiability: where Theory meets Practice (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
1	Chantal Keller, Marc Lasson	Parametricity in an Impredicative Sort.	CSL	2012	DBLP DOI BibTeX RDF
1	Patrick Baillot, Ugo Dal Lago	Higher-Order Interpretations and Program Complexity.	CSL	2012	DBLP DOI BibTeX RDF
1	Lukasz Kaiser, Simon Leßenich	A Counting Logic for Structure Transition Systems.	CSL	2012	DBLP DOI BibTeX RDF
1	Thomas Ehrhard	Collapsing non-idempotent intersection types.	CSL	2012	DBLP DOI BibTeX RDF
1	Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg	A Concurrent Logical Relation.	CSL	2012	DBLP DOI BibTeX RDF
1	Serge Abiteboul	Sharing Distributed Knowledge on the Web (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
1	Stephen A. Cook	Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
1	Thierry Coquand, Anuj Dawar, Damian Niwinski	The Ackermann Award 2012.	CSL	2012	DBLP DOI BibTeX RDF
1	Tomer Kotek, Johann A. Makowsky	Connection Matrices and the Definability of Graph Parameters.	CSL	2012	DBLP DOI BibTeX RDF
1	Pawel Parys	Variants of Collapsible Pushdown Systems.	CSL	2012	DBLP DOI BibTeX RDF
1	Federico Aschieri	Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms.	CSL	2012	DBLP DOI BibTeX RDF
1	Robert Atkey	Relational Parametricity for Higher Kinds.	CSL	2012	DBLP DOI BibTeX RDF
1	Alberto Carraro, Antonino Salibra	On the equational consistency of order-theoretic models of the lambda-calculus.	CSL	2012	DBLP DOI BibTeX RDF
1	Jean-Pierre Jouannaud, Jianqi Li	Church-Rosser Properties of Normal Rewriting.	CSL	2012	DBLP DOI BibTeX RDF
1	Martin Grohe, Martin Otto 0001	Pebble Games and Linear Equations.	CSL	2012	DBLP DOI BibTeX RDF
1	Etienne Grandjean, Frédéric Olive	Descriptive complexity for pictures languages.	CSL	2012	DBLP DOI BibTeX RDF
1	Johann Brault-Baron	A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic.	CSL	2012	DBLP DOI BibTeX RDF
1	Dietrich Kuske	Isomorphisms of scattered automatic linear orders.	CSL	2012	DBLP DOI BibTeX RDF
1	Stefan Hetzl, Lutz Straßburger	Herbrand-Confluence for Cut Elimination in Classical First Order Logic.	CSL	2012	DBLP DOI BibTeX RDF
1	Manfred Kufleitner, Pascal Weil	The FO2 alternation hierarchy is decidable.	CSL	2012	DBLP DOI BibTeX RDF
1	Johann A. Makowsky	Definability and Complexity of Graph Parameters (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
1	Erich Grädel, Simon Leßenich	Banach-Mazur Games with Simple Winning Strategies.	CSL	2012	DBLP DOI BibTeX RDF
1	Patrick Cégielski, Arnaud Durand 0001 (eds.)	Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France	CSL	2012	DBLP BibTeX RDF
1	Satoru Kuroda	Axiomatizing proof tree concepts in Bounded Arithmetic.	CSL	2012	DBLP DOI BibTeX RDF
1	Alexander Rabinovich	A Proof of Kamp's theorem.	CSL	2012	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath	Faster Algorithms for Alternating Refinement Relations.	CSL	2012	DBLP DOI BibTeX RDF
1	Antti Kuusisto, Jeremy Meyers, Jonni Virtema	Undecidable First-Order Theories of Affine Geometries.	CSL	2012	DBLP DOI BibTeX RDF
1	Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller 0001	A Systematic Approach to Canonicity in the Classical Sequent Calculus.	CSL	2012	DBLP DOI BibTeX RDF
1	Takanori Hida	A Computational Interpretation of the Axiom of Determinacy in Arithmetic.	CSL	2012	DBLP DOI BibTeX RDF
1	Thomas Ehrhard	Resource Lambda-Calculus: the Differential Viewpoint.	CSL	2011	DBLP DOI BibTeX RDF
1	Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto	Full Abstraction for Resource Calculus with Tests.	CSL	2011	DBLP DOI BibTeX RDF
1	Marc Bezem (eds.)	Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings	CSL	2011	DBLP BibTeX RDF
1	Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner	L-Recursion and a new Logic for Logarithmic Space.	CSL	2011	DBLP DOI BibTeX RDF
1	Eryk Kopczynski	Trees in Trees: Is the Incomplete Information about a Tree Consistent?.	CSL	2011	DBLP DOI BibTeX RDF
1	Moshe Y. Vardi	Branching vs. Linear Time: Semantical Perspective.	CSL	2011	DBLP DOI BibTeX RDF
1		Frontmatter, Table of Contents, Preface, Conference Organization.	CSL	2011	DBLP DOI BibTeX RDF
1	Lukasz Czajka 0001	A Semantic Approach to Illative Combinatory Logic.	CSL	2011	DBLP DOI BibTeX RDF
1	Steffen Lösch, Andrew M. Pitts	Relating Two Semantics of Locally Scoped Names.	CSL	2011	DBLP DOI BibTeX RDF
1	Andreas Schnabl, Jakob Grue Simonsen	The Exact Hardness of Deciding Derivational and Runtime Complexity.	CSL	2011	DBLP DOI BibTeX RDF
1	Udi Boker, Thomas A. Henzinger	Determinizing Discounted-Sum Automata.	CSL	2011	DBLP DOI BibTeX RDF
1	László Egri	On Constraint Satisfaction Problems below P.	CSL	2011	DBLP DOI BibTeX RDF
1	Alexis Bernadet, Stéphane Lengrand	Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism.	CSL	2011	DBLP DOI BibTeX RDF
1	Makoto Tatsuta, Stefano Berardi	Non-Commutative Infinitary Peano Arithmetic.	CSL	2011	DBLP DOI BibTeX RDF
1	Bernhard Reus, Thomas Streicher	Relative Completeness for Logics of Functional Programs.	CSL	2011	DBLP DOI BibTeX RDF
1	Luca Cardelli, Kim G. Larsen, Radu Mardare	Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas.	CSL	2011	DBLP DOI BibTeX RDF
1	Federico Aschieri	Transfinite Update Procedures for Predicative Systems of Analysis.	CSL	2011	DBLP DOI BibTeX RDF
1	Martin Otto 0001	The Freedoms of Guarded Bisimulation.	CSL	2011	DBLP DOI BibTeX RDF
1	Emanuel Kieronski	Decidability Issues for Two-Variable Logics with Several Linear Orders.	CSL	2011	DBLP DOI BibTeX RDF
1	Ekaterina Komendantskaya, John Power	Coalgebraic Derivations in Logic Programming.	CSL	2011	DBLP DOI BibTeX RDF
1	Yang Cai 0001, Ting Zhang	Tight Upper Bounds for Streett and Parity Complementation.	CSL	2011	DBLP DOI BibTeX RDF
1	Arnaud Durand 0001, Yann Strozecki	Enumeration Complexity of Logical Query Problems with Second-order Variables.	CSL	2011	DBLP DOI BibTeX RDF
1	Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell 0001	The Church Synthesis Problem with Metric.	CSL	2011	DBLP DOI BibTeX RDF
1	Romain Beauxis, Samuel Mimram	A Non-Standard Semantics for Kahn Networks in Continuous Time.	CSL	2011	DBLP DOI BibTeX RDF
1	Dai Tri Man Le, Stephen A. Cook, Yuli Ye	A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem.	CSL	2011	DBLP DOI BibTeX RDF
1	Frank Wolter	Ontology-Based Data Access and Constraint Satisfaction.	CSL	2011	DBLP DOI BibTeX RDF
1	Alexander Kartzow	A Pumping Lemma for Collapsible Pushdown Graphs of Level 2.	CSL	2011	DBLP DOI BibTeX RDF
1	Alexis Bès, Olivier Carton	Algebraic Characterization of FO for Scattered Linear Orderings.	CSL	2011	DBLP DOI BibTeX RDF
1	Johann A. Makowsky	Model Theory in Computer Science: My Own Recurrent Themes.	CSL	2011	DBLP DOI BibTeX RDF
1	Daniel Schwencke	A Category Theoretic View of Nondeterministic Recursive Program Schemes.	CSL	2011	DBLP DOI BibTeX RDF
1	Kord Eickmeyer	Non-Definability Results for Randomised First-Order Logic.	CSL	2011	DBLP DOI BibTeX RDF
1	Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo	A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics.	CSL	2011	DBLP DOI BibTeX RDF
1	Kaustuv Chaudhuri, Nicolas Guenot, Lutz Straßburger	The Focused Calculus of Structures.	CSL	2011	DBLP DOI BibTeX RDF
1	Yoad Lustig, Sumit Nain, Moshe Y. Vardi	Synthesis from Probabilistic Components.	CSL	2011	DBLP DOI BibTeX RDF

Publications at "CSL"( http://dblp.L3S.de/Venues/CSL )