Conferences in DBLP
Sergei N. Artëmov , Jennifer M. Davoren , Anil Nerode Topological Semantics for Hybrid Systems. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:1-8 [Conf ] Gilles Barthe , Morten Heine Sørensen Domain-Free Pure Type Systems. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:9-20 [Conf ] Oleg V. Belegradek , Alexei P. Stolboushkin , Michael A. Taitslin Generic Queries over Quasy-o-minimal Domains. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:21-32 [Conf ] Michael A. Bukatin , Joshua S. Scott Towards Computing Distances Between Programs via Scott Domains. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:33-43 [Conf ] Peter Clote A Safe Recursion Scheme for Exponential Time. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:44-52 [Conf ] Bruno Courcelle Finite Model Theory, Universal Algebra and Graph Grammars. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:53-55 [Conf ] Evgeny Dantsin , Andrei Voronkov Complexity of Query Answering in Logic Databases with Complex Values. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:56-66 [Conf ] Michael I. Dekhtyar , Alexander Ja. Dikovsky Recognition of Deductive Data Base Stability. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:67-77 [Conf ] Sergey Dudakov The Concurrency Complexity for the Horn Fragment of Linear Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:78-87 [Conf ] Valery Durnev Studying Algorithmic Problems for Free Semi-groups and Groups. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:88-101 [Conf ] Rusins Freivalds , Gints Tervits , Rolf Wiehagen , Carl H. Smith Learning Small Programs with Additional Information. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:102-112 [Conf ] Michael Gavrilovich Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:113-118 [Conf ] Mikhail Golovanov Finite Bases of Admissible Rules for the Logic S52C. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:119-129 [Conf ] Philippe de Groote An Algebraic Correctness Criterion for Intuitionistic Proof-Nets. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:130-140 [Conf ] David Harel Towards a Theory of Recursive Structures (extended abstract). [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:141-144 [Conf ] Bernhard Heinemann On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:145-155 [Conf ] Alexey P. Kopylov The Undecidability of Second Order Linear Affine Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:156-166 [Conf ] Vladimir Krupski Operational Logic of Proofs with Functionality Condition on Proof Predicate. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:167-177 [Conf ] Alexei Lisitsa , Vladimir Yu. Sazonov On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:178-188 [Conf ] G. S. Makanin , Habib Abdulrab , Pavel Goralcik Functions for the General Solution of Parametric Word Equations. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:189-202 [Conf ] Evgeny Makarov A Proof Procedure for Hereditary Harrop Formulas with Free Equality. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:203-213 [Conf ] V. Wiktor Marek , Anil Nerode , Jeffrey B. Remmel Basic Forward Chaining Construction for Logic Programs. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:214-225 [Conf ] Maurice Margenstern Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:226-236 [Conf ] Jean-Yves Marion Case Study: Additive Linear Logic and Lattices. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:237-247 [Conf ] Yuri Matiyasevich Some Decision Problems for Traces. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:248-257 [Conf ] Grigori Mints Existential Instantiation and Strong Normalization. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:258-265 [Conf ] Alexey Mkrtychev Models for the Logic of Proofs. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:266-275 [Conf ] Ulrich Nitsche Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:276-282 [Conf ] Hitoshi Ohsaki , Aart Middeldorp Type Introduction for Equational Rewriting. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:283-293 [Conf ] Martin Otto Capturing Bisimulation-Invariant Ptime. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:294-305 [Conf ] Mati Pentus Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:306-311 [Conf ] Guy Perrier A Decidable Fragment of Second Order Linear Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:312-322 [Conf ] Igor Rents , Nikolay V. Shilov Some Results on Propositional Dynamic Logic with Fixed Points. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:323-332 [Conf ] Vladimir V. Rybakov Quasi-Characteristic Inference Rules for Modal Logics. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:333-341 [Conf ] Tatiana Sidon Provability Logic with Operations on Proofs. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:342-353 [Conf ] Robert F. Stärk Formal Verification of Logic Programs: Foundations and Implementation. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:354-368 [Conf ] Igor L. Tandetnik Unification of Terms with Term-Indexed Variables. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:369-373 [Conf ] Igor V. Tarasyuk Back-Forth Equivalences for Design of Concurrent Systems. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:374-384 [Conf ] Gregory S. Tseytin Association Nets: an Alternative Formalization of Common Thinking. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:385-398 [Conf ] Hongwei Xi Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:399-409 [Conf ] Rostislav E. Yavorsky Logical Schemes for First-Order Theories. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:410-418 [Conf ] Vladimir A. Zakharov Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms. [Citation Graph (0, 0)][DBLP ] LFCS, 1997, pp:419-429 [Conf ]