Search results for "CSL"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Rosalie Iemhoff	Towards a Proof System for Admissibility.	CSL	2003	DBLP DOI BibTeX RDF
1	James Laird	Bistability: An Extensional Characterization of Sequentiality.	CSL	2003	DBLP DOI BibTeX RDF
1	Alexandre Miquel	A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory.	CSL	2003	DBLP DOI BibTeX RDF
1	Max I. Kanovich, Jacqueline Vauzeilles	Coping Polynomially with Numerous but Identical Elements within Planning Problems.	CSL	2003	DBLP DOI BibTeX RDF	linear logic
1	Anuj Dawar, David Richerby	A Fixed-Point Logic with Symmetric Choice.	CSL	2003	DBLP DOI BibTeX RDF
1	Helmut Veith	Friends or Foes? Communities in Software Verification (Invited Lecture).	CSL	2003	DBLP DOI BibTeX RDF
1	Lars Kristiansen, Paul J. Voda	The Surprising Power of Restricted Programs and Gödel's Functionals.	CSL	2003	DBLP DOI BibTeX RDF
1	Stefan S. Dantchev, Søren Riis	On Relativisation and Complexity Gap.	CSL	2003	DBLP DOI BibTeX RDF
1	Larisa Maksimova, Andrei Voronkov	Complexity of Some Problems in Modal and Intuitionistic Calculi.	CSL	2003	DBLP DOI BibTeX RDF
1	Igor Walukiewicz	Winning Strategies and Synthesis of Controllers (Tutorial).	CSL	2003	DBLP DOI BibTeX RDF
1	Bruno Buchberger	Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture).	CSL	2003	DBLP DOI BibTeX RDF
1	Yu Zhang, David Nowak	Logical Relations for Dynamic Name Creation.	CSL	2003	DBLP DOI BibTeX RDF	Kripke logical relation, name creation, nu-calculus, categorical models of lambda calculi
1	Martin Grohe, Nicole Schweikardt	Comparing the Succinctness of Monadic Query Languages over Finite Trees.	CSL	2003	DBLP DOI BibTeX RDF
1	Lutz Schröder	Henkin Models of the Partial sigma-Calculus.	CSL	2003	DBLP DOI BibTeX RDF
1	Bernhard K. Aichernig	The Commuting V-Diagram.	CSL	2003	DBLP DOI BibTeX RDF	formal methods, refinement, contracts, specification-based testing, refinement calculus
1	Masahiko Sato 0001, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi	Calculi of Meta-variables.	CSL	2003	DBLP DOI BibTeX RDF
1	Thomas Eiter, Kazuhisa Makino	Generating All Abductive Explanations for Queries on Propositional Horn Theories.	CSL	2003	DBLP DOI BibTeX RDF	Horn theories, polynomial total time computation, NP-hardness, abduction, propositional logic, Computational logic
1	Hans Leiß, Michel de Rougemont	Automata on Lempel-ziv Compressed Strings.	CSL	2003	DBLP DOI BibTeX RDF
1	Nicolai N. Vorobjov Jr.	Effective Quantifier Elimination over Real Closed Fields (Tutorial).	CSL	2003	DBLP DOI BibTeX RDF
1	Margarita V. Korovina	Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test.	CSL	2003	DBLP DOI BibTeX RDF
1	Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons 0001, Andrei A. Krokhin	Quantified Constraints: Algorithms and Complexity.	CSL	2003	DBLP DOI BibTeX RDF
1	Jacques Duparc	Positive Games and Persistent Strategies.	CSL	2003	DBLP DOI BibTeX RDF
1	Yijia Chen, Jörg Flum	Machine Characterization of the Classes of the W-Hierarchy.	CSL	2003	DBLP DOI BibTeX RDF
1	Bernhard Reus	Modular Semantics and Logics of Classes.	CSL	2003	DBLP DOI BibTeX RDF
1	Matthias Baaz, Johann A. Makowsky (eds.)	Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings	CSL	2003	DBLP DOI BibTeX RDF
1	Lukasz Krzeszczakowski	Pebble Games on Trees.	CSL	2003	DBLP DOI BibTeX RDF
1	Bakhadyr Khoussainov	On Algebraic Specifications of Abstract Data Types.	CSL	2003	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso	Deciding Monotonic Games.	CSL	2003	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Jaroslav Nesetril	Constraint Satisfaction with Countable Homogeneous Templates.	CSL	2003	DBLP DOI BibTeX RDF
1	Georg Moser, Richard Zach	The Epsilon Calculus (Tutorial).	CSL	2003	DBLP DOI BibTeX RDF
1	Jean-Marc Andreoli, Laurent Mazaré	Concurrent Construction of Proof-Nets.	CSL	2003	DBLP DOI BibTeX RDF
1	René David, Bruno Guillaume	Strong Normalization of the Typed gammaws-Calculus.	CSL	2003	DBLP DOI BibTeX RDF
1	Christian Urban, Andrew M. Pitts, Murdoch Gabbay	Nominal Unificaiton.	CSL	2003	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov	Back to the Future: Explicit Logic for Computer Science (Invited Lecture).	CSL	2003	DBLP DOI BibTeX RDF
1	George Metcalfe, Nicola Olivetti, Dov M. Gabbay	Goal-Directed Calculli for Gödel-Dummett Logics.	CSL	2003	DBLP DOI BibTeX RDF	Gödel Logics, Hypersequents, Goal-Directed Calculi, Fuzzy Logics, Intermediate Logics
1	Julian C. Bradfield	Parity of Imperfection of Fixing Independence.	CSL	2003	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani	Verification of Infinite State Systems (Tutorial).	CSL	2003	DBLP DOI BibTeX RDF
1	Nicolai N. Vorobjov Jr.	Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).	CSL	2003	DBLP DOI BibTeX RDF
1	Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron	Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.	CSL	2003	DBLP DOI BibTeX RDF
1	Ron van der Meyden, Manas K. Patra	A Logic for Probability in Quantum Systems.	CSL	2003	DBLP DOI BibTeX RDF
1	Kai Brünnler	Atomic Cut Elimination for classical Logic.	CSL	2003	DBLP DOI BibTeX RDF	atomic cut, sequent calculus, cut elimination, natural deduction, classical logic
1	Philipp Gerhardy	Refined Complexity Analysis of Cut Elimination.	CSL	2003	DBLP DOI BibTeX RDF
1	Detlef Kähler, Thomas Wilke	Program Complexity of Dynamic LTL Model Checking.	CSL	2003	DBLP DOI BibTeX RDF
1	Phokion G. Kolaitis, Jonathan Panttaja	On the Complexity of Existential Pebble Games.	CSL	2003	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq	Higher-Order Positive Set Constraints.	CSL	2002	DBLP DOI BibTeX RDF
1	Régis Barbanchon, Etienne Grandjean	Local Problems, Planar Local Problems and Linear Time.	CSL	2002	DBLP DOI BibTeX RDF
1	Paul Blain Levy	Possible World Semantics for General Storage in Call-By-Value.	CSL	2002	DBLP DOI BibTeX RDF
1	Claudia Faggian	Travelling on Designs.	CSL	2002	DBLP DOI BibTeX RDF
1	Frank Neven	Automata, Logic, and XML.	CSL	2002	DBLP DOI BibTeX RDF
1	Yifeng Chen	A Fixpoint Theory for Non-monotonic Parallelism.	CSL	2002	DBLP DOI BibTeX RDF
1	Albert Atserias, Maria Luisa Bonet	On the Automatizability of Resolution and Related Propositional Proof Systems.	CSL	2002	DBLP DOI BibTeX RDF
1	Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin	Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle.	CSL	2002	DBLP DOI BibTeX RDF	superintuitionistic logics, Kolmogorov complexity, realizability
1	Pietro Cenciarelli	Configuration Theories.	CSL	2002	DBLP DOI BibTeX RDF	configuration structures, Java, semantics, concurrency, sequent calculus
1	Zoltán Ésik, Hans Leiß	Greibach Normal Form in Algebraically Complete Semirings.	CSL	2002	DBLP DOI BibTeX RDF	Greibach normal form, pre-fixed-point induction, Conway algebra, algebraically complete semirings, context-free languages, Kleene algebra, equational theory
1	Douglas S. Bridges, Hajime Ishihara, Peter Schuster 0001	Compactness and Continuity, Constructively Revisited.	CSL	2002	DBLP DOI BibTeX RDF
1	Claudia Faggian, Martin Hyland	Designs, Disputes and Strategies.	CSL	2002	DBLP DOI BibTeX RDF
1	M. Andrew Moshier, Achim Jung	A Logic for Probabilities in Semantics.	CSL	2002	DBLP DOI BibTeX RDF
1	Harry G. Mairson, Xavier Rival	Proofnets and Context Semantics for the Additives.	CSL	2002	DBLP DOI BibTeX RDF
1	Tobias Nipkow	Hoare Logics for Recursive Procedures and Unbounded Nondeterminism.	CSL	2002	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß, Klaus U. Schulz	Decidability of Bounded Higher-Order Unification.	CSL	2002	DBLP DOI BibTeX RDF
1	Thierry Cachat, Jacques Duparc, Wolfgang Thomas	Solving Pushdown Games with a Sigma3 Winning Condition.	CSL	2002	DBLP DOI BibTeX RDF
1	Daniel Leivant	Implicit Computational Complexity for Higher Type Functionals.	CSL	2002	DBLP DOI BibTeX RDF
1	Guy McCusker	A Fully Abstract Relational Model of Syntactic Control of Interference.	CSL	2002	DBLP DOI BibTeX RDF	Algol-like languages, interference control, semantics, full abstraction, monoids, object spaces
1	Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko	A Logic of Probability with Decidable Model-Checking.	CSL	2002	DBLP DOI BibTeX RDF
1	Masahito Hasegawa	Classical Linear Logic of Implications.	CSL	2002	DBLP DOI BibTeX RDF
1	Max I. Kanovich	Bijections between Partitions by Two-Directional Rewriting Techniques.	CSL	2002	DBLP DOI BibTeX RDF	multiset rewriting, partition identities, termination, combinatorics, confluence, strong normalization, Church-Rosser property, integer partitions
1	Damian Niwinski	µ-Calculus via Games.	CSL	2002	DBLP DOI BibTeX RDF
1	Antonín Kucera 0001, Jan Strejcek	The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL.	CSL	2002	DBLP DOI BibTeX RDF
1	Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer	Equivalence and Isomorphism for Boolean Constraint Satisfaction.	CSL	2002	DBLP DOI BibTeX RDF
1	Dietmar Berwanger, Erich Grädel, Giacomo Lenzi	On the Variable Hierarchy of the Modal µ-Calculus.	CSL	2002	DBLP DOI BibTeX RDF	modal &#55-calculus, games, descriptive complexity
1	Yoshihiko Kakutani	Duality between Call-by-Name Recursion and Call-by-Value Iteration.	CSL	2002	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq, Slawomir Lasota 0001, David Nowak	Logical Relations for Monadic Types.	CSL	2002	DBLP DOI BibTeX RDF	semantics, monads, logical relations, typed lambda-calculus
1	Matthias Baaz, Georg Moser	On Generalizations of Semi-terms of Particularly Simple Form.	CSL	2002	DBLP DOI BibTeX RDF	Structure of Proofs, Complexity of Programs, Proof Theory
1	Klaus Aehlig, Felix Joachimski	On Continuous Normalization.	CSL	2002	DBLP DOI BibTeX RDF
1	Julian C. Bradfield (eds.)	Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings	CSL	2002	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Resolution Refutations and Propositional Proofs with Height-Restrictions.	CSL	2002	DBLP DOI BibTeX RDF	Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus
1	Herman Geuvers, Gueorgui I. Jojgov	Open Proofs and Open Terms: A Basis for Interactive Logic.	CSL	2002	DBLP DOI BibTeX RDF	open terms, meta-variables, formulas-as-types, type theory, interactive theorem proving
1	Susumu Hayashi, Yohji Akama	Limit-Computable Mathematics and Its Applications.	CSL	2002	DBLP DOI BibTeX RDF
1	Stephan Kreutzer	Partial Fixed-Point Logic on Infinite Structures.	CSL	2002	DBLP DOI BibTeX RDF
1	Didier Galmiche, Daniel Méry, David J. Pym	Resource Tableaux.	CSL	2002	DBLP DOI BibTeX RDF
1	Ichiro Ogata	A Proof Theoretical Account of Continuation Passing Style.	CSL	2002	DBLP DOI BibTeX RDF	Classical Natural Deduction, LKQ, classical proof theory, Classical Logic, CPS-translation, Call-By-Value
1	Jerzy Marcinkowski, Tomasz Truderung	Optimal Complexity Bounds for Positive LTL Games.	CSL	2002	DBLP DOI BibTeX RDF
1	Joshua S. Hodas, Pablo López, Jeffrey Polakow, Lubomira Stoilova, Ernesto Pimentel 0001	A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming.	CSL	2002	DBLP DOI BibTeX RDF
1	Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger	Trading Probability for Fairness.	CSL	2002	DBLP DOI BibTeX RDF
1	Hans de Nivelle	Extraction of Proofs from the Clausal Normal Form Transformation.	CSL	2002	DBLP DOI BibTeX RDF
1	Carsten Schürmann	Recursion for Higher-Order Encodings.	CSL	2001	DBLP DOI BibTeX RDF
1	Simona Ronchi Della Rocca, Luca Roversi	Intersection Logic.	CSL	2001	DBLP DOI BibTeX RDF
1	Peter W. O'Hearn, John C. Reynolds, Hongseok Yang	Local Reasoning about Programs that Alter Data Structures.	CSL	2001	DBLP DOI BibTeX RDF
1	Hitoshi Ohsaki	Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.	CSL	2001	DBLP DOI BibTeX RDF	decidability, Tree automata, equational theory
1	Anuj Dawar, Erich Grädel, Stephan Kreutzer	Inflationary Fixed Points in Modal Logic.	CSL	2001	DBLP DOI BibTeX RDF
1	Lutz Schröder	Life without the Terminal Type.	CSL	2001	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß	Stratified Context Unification Is in PSPACE.	CSL	2001	DBLP DOI BibTeX RDF
1	Max I. Kanovich	The Expressive Power of Horn Monadic Linear Logic.	CSL	2001	DBLP DOI BibTeX RDF
1	Nicole Schweikardt	The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered Group.	CSL	2001	DBLP DOI BibTeX RDF	Database Theory, Constructive Mathematics, Logic in Computer Science
1	John Power, Konstantinos Tourlas	An Algebraic Foundation for Higraphs.	CSL	2001	DBLP DOI BibTeX RDF
1	Frédéric Koriche	A Logic for Approximate First-Order Reasoning.	CSL	2001	DBLP DOI BibTeX RDF	resource-bounded algorithms, first-order logic, approximate reasoning, multi-modal logics
1	Jan van Eijck	Constrained Hyper Tableaux.	CSL	2001	DBLP DOI BibTeX RDF
1	Jean-Yves Marion	Actual Arithmetic and Feasibility.	CSL	2001	DBLP DOI BibTeX RDF
1	Laurent Fribourg (eds.)	Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings	CSL	2001	DBLP DOI BibTeX RDF
1	Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter	Categorical and Kripke Semantics for Constructive S4 Modal Logic.	CSL	2001	DBLP DOI BibTeX RDF

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