Search results for "LFCS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	David Harel	Towards a Theory of Recursive Structures (extended abstract).	LFCS	1997	DBLP DOI BibTeX RDF
1	Ulrich Nitsche	Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences.	LFCS	1997	DBLP DOI BibTeX RDF
1	Alexey Mkrtychev	Models for the Logic of Proofs.	LFCS	1997	DBLP DOI BibTeX RDF
1	Alexey P. Kopylov	The Undecidability of Second Order Linear Affine Logic.	LFCS	1997	DBLP DOI BibTeX RDF
1	Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith	Learning Small Programs with Additional Information.	LFCS	1997	DBLP DOI BibTeX RDF
1	Michael I. Dekhtyar, Alexander Ja. Dikovsky	Recognition of Deductive Data Base Stability.	LFCS	1997	DBLP DOI BibTeX RDF
1	Sergey M. Dudakov	The Concurrency Complexity for the Horn Fragment of Linear Logic.	LFCS	1997	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Andrei Voronkov	Complexity of Query Answering in Logic Databases with Complex Values.	LFCS	1997	DBLP DOI BibTeX RDF
1	Igor L. Tandetnik	Unification of Terms with Term-Indexed Variables.	LFCS	1997	DBLP DOI BibTeX RDF
1	Bruno Courcelle	Finite Model Theory, Universal Algebra and Graph Grammars.	LFCS	1997	DBLP DOI BibTeX RDF
1	Igor V. Tarasyuk	Back-Forth Equivalences for Design of Concurrent Systems.	LFCS	1997	DBLP DOI BibTeX RDF
1	Sergei I. Adian, Anil Nerode (eds.)	Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings	LFCS	1997	DBLP DOI BibTeX RDF
1	Mikhail Golovanov	Finite Bases of Admissible Rules for the Logic S52C.	LFCS	1997	DBLP DOI BibTeX RDF
1	Jean-Yves Marion	Case Study: Additive Linear Logic and Lattices.	LFCS	1997	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Jennifer M. Davoren, Anil Nerode	Topological Semantics for Hybrid Systems.	LFCS	1997	DBLP DOI BibTeX RDF
1	Michael Gavrilovich	Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension.	LFCS	1997	DBLP DOI BibTeX RDF
1	Tatiana Sidon	Provability Logic with Operations on Proofs.	LFCS	1997	DBLP DOI BibTeX RDF
1	Michael A. Bukatin, Joshua S. Scott	Towards Computing Distances Between Programs via Scott Domains.	LFCS	1997	DBLP DOI BibTeX RDF
1	Grigori Mints	Existential Instantiation and Strong Normalization.	LFCS	1997	DBLP DOI BibTeX RDF
1	Evgeny Makarov	A Proof Procedure for Hereditary Harrop Formulas with Free Equality.	LFCS	1997	DBLP DOI BibTeX RDF
1	V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel	Basic Forward Chaining Construction for Logic Programs.	LFCS	1997	DBLP DOI BibTeX RDF
1	Gregory S. Tseytin	Association Nets: an Alternative Formalization of Common Thinking.	LFCS	1997	DBLP DOI BibTeX RDF
1	Vladimir Krupski	Operational Logic of Proofs with Functionality Condition on Proof Predicate.	LFCS	1997	DBLP DOI BibTeX RDF
1	Gilles Barthe, Morten Heine Sørensen	Domain-Free Pure Type Systems.	LFCS	1997	DBLP DOI BibTeX RDF
1	Hitoshi Ohsaki, Aart Middeldorp	Type Introduction for Equational Rewriting.	LFCS	1997	DBLP DOI BibTeX RDF
1	Mati Pentus	Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic.	LFCS	1997	DBLP DOI BibTeX RDF
1	Hongwei Xi	Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus.	LFCS	1997	DBLP DOI BibTeX RDF
1	Vladimir A. Zakharov	Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms.	LFCS	1997	DBLP DOI BibTeX RDF
1	Bernhard Heinemann	On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces.	LFCS	1997	DBLP DOI BibTeX RDF
1	Peter Clote	A Safe Recursion Scheme for Exponential Time.	LFCS	1997	DBLP DOI BibTeX RDF
1	Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin	Generic Queries over Quasy-o-minimal Domains.	LFCS	1997	DBLP DOI BibTeX RDF
1	Igor Rents, Nikolay V. Shilov 0002	Some Results on Propositional Dynamic Logic with Fixed Points.	LFCS	1997	DBLP DOI BibTeX RDF
1	Philippe de Groote	An Algebraic Correctness Criterion for Intuitionistic Proof-Nets.	LFCS	1997	DBLP DOI BibTeX RDF
1	Guy Perrier	A Decidable Fragment of Second Order Linear Logic.	LFCS	1997	DBLP DOI BibTeX RDF
1	Dmitry A. Archangelsky, Michael I. Dekhtyar, Evgeny Kruglov, Ilmir Kh. Musikaev, Mikhail A. Taitslin	Concurrency Problem for Horn Fragment of Girard's Linear Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Bakhadyr Khoussainov, Anil Nerode	The Notion of Rank and Games.	LFCS	1994	DBLP DOI BibTeX RDF
1	Ulrich Nitsche	Propositional Linear Temporal Logic and Language Homomorphisms.	LFCS	1994	DBLP DOI BibTeX RDF
1	Cheng-Chia Chen, I-Peng Lin	The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories.	LFCS	1994	DBLP DOI BibTeX RDF
1	Zurab Khasidashvili	The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems.	LFCS	1994	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Vladimir Krupski	Referential Data Structures and Labeled Modal Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Xiaolin Ge, Anil Nerode	On Extreme Points of Convex Compact Turing Located Set.	LFCS	1994	DBLP DOI BibTeX RDF
1	Daniel Leivant	Predicative Recurrence in Finite Types.	LFCS	1994	DBLP DOI BibTeX RDF
1	Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham	The Parameterized Complexity of Some Problems in Logic and Linguistics.	LFCS	1994	DBLP DOI BibTeX RDF
1	Hanno Nickau	Hereditarily Sequential Functionals.	LFCS	1994	DBLP DOI BibTeX RDF
1	Sergei S. Goncharov, Serikzhan A. Badaev	Classes with Pairwise Equivalent Enumerations.	LFCS	1994	DBLP DOI BibTeX RDF
1	Andrea Asperti, Giovanna M. Dore	Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX.	LFCS	1994	DBLP DOI BibTeX RDF
1	Paula Severi, Erik Poll	Pure Type Systems with Definitions.	LFCS	1994	DBLP DOI BibTeX RDF
1	Bart Jacobs 0001	Coalgebras and Approximation.	LFCS	1994	DBLP DOI BibTeX RDF
1	Ramón Pino Pérez, Christian Even	An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus.	LFCS	1994	DBLP DOI BibTeX RDF
1	Carolyn Brown, Alan Jeffrey	Allegories of Circuits.	LFCS	1994	DBLP DOI BibTeX RDF
1	Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn	Comparing Cubes.	LFCS	1994	DBLP DOI BibTeX RDF
1	Bernhard Heinemann	On Expressive Completeness of Modal Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Max I. Kanovich	Computational and Concurrency Models of Linear Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Vincent van Oostrom, Femke van Raamsdonk	Weak Orthogonality Implies Confluence: The Higher Order Case.	LFCS	1994	DBLP DOI BibTeX RDF
1	Sergey Berezin, Nikolay V. Shilov 0002	An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-Calculus.	LFCS	1994	DBLP DOI BibTeX RDF
1	Didier Galmiche, Guy Perrier	Foundations of Proof Search Strategies Design in Linear Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Henrik Reif Andersen	On Model Checking Infinite-State Systems.	LFCS	1994	DBLP DOI BibTeX RDF
1	Vladimir V. Rybakov	Preserving of Admissible Inference Rules in Modal Logics.	LFCS	1994	DBLP DOI BibTeX RDF
1	Johann A. Makowsky, Y. B. Pnueli	Arity vs. Alternation in Second Order Logic.	LFCS	1994	DBLP DOI BibTeX RDF
1	Farid M. Ablayev	Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.	LFCS	1994	DBLP DOI BibTeX RDF
1	Aida Pliuskeviciene, Regimantas Pliuskevicius, Michal Walicki, Sigurd Meldal	On Specialization of Derivations in Axiomatic Equality Theories.	LFCS	1994	DBLP DOI BibTeX RDF
1	Wiebe van der Hoek, Bernd van Linder, John-Jules Ch. Meyer	A Logic of Capabilities.	LFCS	1994	DBLP DOI BibTeX RDF
1	Silvia Ghilezan	Application of Typed Lambda Calculi in the Untyped Lambda Calculus.	LFCS	1994	DBLP DOI BibTeX RDF
1	Tatiana Sidon	Craig Interpolation Property in Modal Logics with Provability Interpretation.	LFCS	1994	DBLP DOI BibTeX RDF
1	Raymond Hoofman	Comparing Models of the Non-Extensional Typed Lambda-Calculus.	LFCS	1994	DBLP DOI BibTeX RDF
1	Bonnie Traylor, Michael Gelfond	Representing Null Values in Logic Programming.	LFCS	1994	DBLP DOI BibTeX RDF
1	Anil Nerode, Yuri V. Matiyasevich (eds.)	Logical Foundations of Computer Science, Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11-14, 1994, Proceedings	LFCS	1994	DBLP DOI BibTeX RDF
1	Alex Dekhtyar	Multiplicative Linear Logic for Resource Transformation Nets.	LFCS	1994	DBLP DOI BibTeX RDF
1	Mikle Kuchuganov	A Predicate Logic of Well-Founded Actions.	LFCS	1994	DBLP DOI BibTeX RDF
1	Philippe de Groote	Strong Normalization in a Non-Deterministic Typed Lambda-Calculus.	LFCS	1994	DBLP DOI BibTeX RDF
1	Aida Pliuskeviciene	Sequential Calculus for Proving the Properties of Regular Programs.	LFCS	1992	DBLP DOI BibTeX RDF
1	Allen L. Brown Jr., Surya Mantha, Toshiro Wakayama	Preference Logics and Non-Monotonicity in Logic Programming.	LFCS	1992	DBLP DOI BibTeX RDF
1	A. Calò, Johann A. Makowsky	The Ehrenfeucht-Fraisse Games for Transitive Closure.	LFCS	1992	DBLP DOI BibTeX RDF
1	Alan Mycroft	Incremental Polymorphic Type Checking with Update.	LFCS	1992	DBLP DOI BibTeX RDF
1	Zhaohui Luo	A Unifying Theory of Dependent Types: The Schematic Approach.	LFCS	1992	DBLP DOI BibTeX RDF
1	Kamel Sadi, François Meunier	An And-Parallelism Cooperative Scheme for Full Prolog Interpreters on a Transputer-Based Architecture.	LFCS	1992	DBLP DOI BibTeX RDF
1	Jan A. Plaza	Operators on Lattices of omega-Herbrand Interpretations.	LFCS	1992	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Edward M. Reingold	Ordinal Arithmetic with List Structures.	LFCS	1992	DBLP DOI BibTeX RDF
1	Anil Nerode, Michael A. Taitslin (eds.)	Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings	LFCS	1992	DBLP DOI BibTeX RDF
1	Frank Leßke	Constructive Specifications of Abstract Data Types Using Temporal Logic.	LFCS	1992	DBLP DOI BibTeX RDF
1	Liang Chen	An Interleaving Model for Real-Time Systems.	LFCS	1992	DBLP DOI BibTeX RDF
1	Karlis Cerans	Feasibility of Finite and Infinite Paths in Data Dependent Programs.	LFCS	1992	DBLP DOI BibTeX RDF
1	Sergei Tupailo	Gentzen-Style and Novikov-Style Cut-Elimination.	LFCS	1992	DBLP DOI BibTeX RDF
1	Melvin Fitting	Many-Valued Non-Monotonic Modal Logics.	LFCS	1992	DBLP DOI BibTeX RDF
1	Sergey V. Kotov	Typed lamda-Calculus with Recursive Definitions.	LFCS	1992	DBLP DOI BibTeX RDF
1	Dmitry A. Archangelsky, Mikhail A. Taitslin	Modular Linear Logic.	LFCS	1992	DBLP DOI BibTeX RDF
1	Bernd-Holger Schlingloff	On the Expressive Power of Modal Logics on Trees.	LFCS	1992	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich	Non Modularity and Expressibility for Nets of Relations.	LFCS	1992	DBLP DOI BibTeX RDF
1	V. P. Makarov	MSL - A Mathematical Specification Language.	LFCS	1992	DBLP DOI BibTeX RDF
1	Wolfgang Reif	Correctness of Generic Modules.	LFCS	1992	DBLP DOI BibTeX RDF
1	Richard Beigel, Martin Kummer, Frank Stephan 0001	Quantifying the Amount of Verboseness.	LFCS	1992	DBLP DOI BibTeX RDF
1	Sachio Hirokawa	Balanced Formulas, BCK-Minimal Formulas and Their Proofs.	LFCS	1992	DBLP DOI BibTeX RDF
1	Nikolai K. Kossovsky, A. B. Prokhoroff	The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited.	LFCS	1992	DBLP DOI BibTeX RDF
1	Alberto Momigliano	Minimal Negation and Hereditary Harrop Formulae.	LFCS	1992	DBLP DOI BibTeX RDF
1	B. Gamatie	Intensionally Stable Functions.	LFCS	1992	DBLP DOI BibTeX RDF
1	Renwei Li, José Carmo	An Interval-Based Modal Logic for System Specification.	LFCS	1992	DBLP DOI BibTeX RDF
1	Iain A. Stewart	Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines.	LFCS	1992	DBLP DOI BibTeX RDF
1	Wiebe van der Hoek, John-Jules Ch. Meyer	Graded Modalities in Epistemic Logic.	LFCS	1992	DBLP DOI BibTeX RDF
1	Philippe de Groote	Denotations for Classical Proofs - Preliminary Results.	LFCS	1992	DBLP DOI BibTeX RDF
1	Lane A. Hemachandra, Sanjay Jain 0001, Nikolai K. Vereshchagin	Banishing Robust Turing Completeness.	LFCS	1992	DBLP DOI BibTeX RDF

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