The SCEAS System
Navigation Menu

Conferences in DBLP

Logical Foundations of Computer Science (LFCS) (lfcs)
1997 (conf/lfcs/1997)

  1. 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]
  2. Gilles Barthe, Morten Heine Sørensen
    Domain-Free Pure Type Systems. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:9-20 [Conf]
  3. 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]
  4. 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]
  5. Peter Clote
    A Safe Recursion Scheme for Exponential Time. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:44-52 [Conf]
  6. Bruno Courcelle
    Finite Model Theory, Universal Algebra and Graph Grammars. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:53-55 [Conf]
  7. 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]
  8. Michael I. Dekhtyar, Alexander Ja. Dikovsky
    Recognition of Deductive Data Base Stability. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:67-77 [Conf]
  9. Sergey Dudakov
    The Concurrency Complexity for the Horn Fragment of Linear Logic. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:78-87 [Conf]
  10. Valery Durnev
    Studying Algorithmic Problems for Free Semi-groups and Groups. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:88-101 [Conf]
  11. 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]
  12. 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]
  13. Mikhail Golovanov
    Finite Bases of Admissible Rules for the Logic S52C. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:119-129 [Conf]
  14. Philippe de Groote
    An Algebraic Correctness Criterion for Intuitionistic Proof-Nets. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:130-140 [Conf]
  15. David Harel
    Towards a Theory of Recursive Structures (extended abstract). [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:141-144 [Conf]
  16. 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]
  17. Alexey P. Kopylov
    The Undecidability of Second Order Linear Affine Logic. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:156-166 [Conf]
  18. Vladimir Krupski
    Operational Logic of Proofs with Functionality Condition on Proof Predicate. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:167-177 [Conf]
  19. 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]
  20. 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]
  21. Evgeny Makarov
    A Proof Procedure for Hereditary Harrop Formulas with Free Equality. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:203-213 [Conf]
  22. 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]
  23. 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]
  24. Jean-Yves Marion
    Case Study: Additive Linear Logic and Lattices. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:237-247 [Conf]
  25. Yuri Matiyasevich
    Some Decision Problems for Traces. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:248-257 [Conf]
  26. Grigori Mints
    Existential Instantiation and Strong Normalization. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:258-265 [Conf]
  27. Alexey Mkrtychev
    Models for the Logic of Proofs. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:266-275 [Conf]
  28. 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]
  29. Hitoshi Ohsaki, Aart Middeldorp
    Type Introduction for Equational Rewriting. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:283-293 [Conf]
  30. Martin Otto
    Capturing Bisimulation-Invariant Ptime. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:294-305 [Conf]
  31. 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]
  32. Guy Perrier
    A Decidable Fragment of Second Order Linear Logic. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:312-322 [Conf]
  33. 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]
  34. Vladimir V. Rybakov
    Quasi-Characteristic Inference Rules for Modal Logics. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:333-341 [Conf]
  35. Tatiana Sidon
    Provability Logic with Operations on Proofs. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:342-353 [Conf]
  36. Robert F. Stärk
    Formal Verification of Logic Programs: Foundations and Implementation. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:354-368 [Conf]
  37. Igor L. Tandetnik
    Unification of Terms with Term-Indexed Variables. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:369-373 [Conf]
  38. Igor V. Tarasyuk
    Back-Forth Equivalences for Design of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:374-384 [Conf]
  39. Gregory S. Tseytin
    Association Nets: an Alternative Formalization of Common Thinking. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:385-398 [Conf]
  40. 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]
  41. Rostislav E. Yavorsky
    Logical Schemes for First-Order Theories. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:410-418 [Conf]
  42. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002