Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)

26-28 June 2000

Filter Results

Displaying Results 1 - 25 of 41
  • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)

    Publication Year: 2000
    Request permission for reuse | PDF file iconPDF (208 KB)
    Freely Available from IEEE
  • Logic, complexity, and games

    Publication Year: 2000, Page(s): 3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (70 KB)

    Summary form only given. The author summarizes his proposed talk on an approach to the P = NP question via the correspondence between logic and complexity. The main focus will be on the possible use of Ehrenfeucht-Fra-sse games. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general notion of realizability

    Publication Year: 2000, Page(s):7 - 17
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    We present a general notion of realizability, encompassing both standard Kleene style realizability over partial combinatory algebras and Kleene style realizability over more general structures, including all partial cartesian closed categories. We show how the general notion of realizability can be used to get models of dependent predicate logic, thus obtaining as a corollary (the known result) t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for impredicative type systems, universes, intersection types and subtyping

    Publication Year: 2000, Page(s):18 - 29
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (361 KB)

    We introduce a novel model based on coherence spaces for interpreting large impredicative type systems such as the Extended Calculus of Constructions (ECC). Moreover we show that this model is well-suited for interpreting intersection types and subtyping too, and we illustrate this by interpreting a variant of ECC with an additional intersection type binder. Furthermore, we propose a general metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete axioms for categorical fixed-point operators

    Publication Year: 2000, Page(s):30 - 41
    Cited by:  Papers (25)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (417 KB)

    We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of decidability in first order separations over classes of finite structures

    Publication Year: 2000, Page(s):45 - 50
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (235 KB)

    We establish that the decidability of the first order theory of a class of finite structures C is a simple and useful condition for guaranteeing that the expressive power of FO+LFP properly extends that of FO on C, unifying separation results for various classes of structures that have been studied. We then apply this result to show that it encompasses certain constructive pebble game techniques w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic structures

    Publication Year: 2000, Page(s):51 - 62
    Cited by:  Papers (42)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (406 KB)

    We study definability and complexity issues for automatic and /spl omega/-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover they admit effective (in fact automatic) evaluation of all first-order queries. Therefore, automatic structures provide an interesting framework for extending many algorithmic and logical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definability and compression

    Publication Year: 2000, Page(s):63 - 73
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K' as output. Given a property P on the class K defined in a logic /spl Lscr/, we study the definability of property P on the class K'. We consider two compression schemas on unary ordered structures (words), compression by runlength encoding and the classical Lempel-Ziv. Fir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-bounded continuity and sequentiality for type-two functionals

    Publication Year: 2000, Page(s):77 - 83
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (258 KB)

    We define notions of resource-bounded continuity and sequentiality for type-two functionals with total inputs, and prove that in the resource-bounded model there are continuous functionals which cannot be efficiently simulated by sequential functionals. We also show that for some naturally defined classes of continuous functionals, an efficient simulation is possible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A syntactical analysis of non-size-increasing polynomial time computation

    Publication Year: 2000, Page(s):84 - 91
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    A purely syntactical proof is given that all functions definable in a certain affine linear typed /spl lambda/-calculus with iteration in all types are polynomial time computable. The proof also gives explicit polynomial bounds that can easily be calculated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating labeled Markov processes

    Publication Year: 2000, Page(s):95 - 106
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (387 KB)

    We study approximate reasoning about continuous-state labeled Markov processes. We show how to approximate a labeled Markov process by a family of finite-state labeled Markov chains. We show that the collection of labeled Markov processes carries a Polish space structure with a countable basis given by finite state Markov chains with rational probabilities. The primary technical tools that we deve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precongruence formats for decorated trace preorders

    Publication Year: 2000, Page(s):107 - 118
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (490 KB)

    This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's (1981) structural approach. For several preorders in the linear time-branching time spectrum a format is given, as general as possible, such that this preorder is a prec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual symmetry reduction

    Publication Year: 2000, Page(s):121 - 131
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    We provide a general method for ameliorating state explosion via symmetry reduction in certain asymmetric systems, such as systems with many similar, but not identical, processes. The method applies to systems whose structures (i.e., state transition graphs) have more state symmetries than arc symmetries. We introduce a new notion of "virtual symmetry" that strictly subsumes earlier notions of "ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better is better than well: on efficient verification of infinite-state systems

    Publication Year: 2000, Page(s):132 - 140
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (417 KB)

    Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However, m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent omega-regular games

    Publication Year: 2000, Page(s):141 - 154
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (433 KB)

    We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate pattern matching is expressible in transitive closure logic

    Publication Year: 2000, Page(s):157 - 167
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (349 KB)

    A sartorial query language facilitates the formulation of queries to a (string) database. One step towards an implementation of such a query language can be taken by defining a logical formalism expressing a known solution for the particular problem at hand. The simplicity of the logic is a desired property because the simpler the logic that the query language is based on, the more efficiently it ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational complexity of some problems involving congruences on algebras

    Publication Year: 2000, Page(s):168 - 174
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (223 KB)

    We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra generated by a set of pairs, and determining whether a given algebra is simple or subdirectly irreducible. We also consider the problem of determining the smallest fully invariant congruence on a given algebra containing a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From the church-turing thesis to the first-order algorithm theorem

    Publication Year: 2000, Page(s): 177
    Request permission for reuse | PDF file iconPDF (91 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satisfiability testing: recent developments and challenge problems

    Publication Year: 2000, Page(s): 178
    Cited by:  Papers (1)
    Request permission for reuse | PDF file iconPDF (40 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dominator trees and fast verification of proof nets

    Publication Year: 2000, Page(s):181 - 191
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (310 KB)

    We consider the following decision problems. PROOFNET: given a multiplicative linear logic (MLL) proof structure, is it a proof net? ESSNET: given an essential net (of an intuitionistic MLL sequent), is it correct? The authors show that linear-time algorithms for ESSNET can be obtained by constructing the dominator tree of the input essential net. As a corollary, by showing that PROOFNET is linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game semantics and subtyping

    Publication Year: 2000, Page(s):192 - 203
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (337 KB)

    While game semantics has been remarkably successful at modelling, often in a fully abstract manner a wide range of features of programming languages, there has to date been no attempt at applying it to subtyping. We show how the simple device of explicitly introducing error values in the syntax of the calculus leads to a notion of subtyping for game semantics. We construct an interpretation of a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic game semantics

    Publication Year: 2000, Page(s):204 - 213
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (331 KB)

    A category of HO/N-style games and probabilistic strategies is developed where the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A 2-sided die is shown to be universal in this category, in the sense that any strategy breaks down into a composition between some deterministic strategy and that die. The interpretative power of the cate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Back and forth between guarded and modal logics

    Publication Year: 2000, Page(s):217 - 228
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (399 KB)

    Guarded fixed point logic /spl mu/GF extends the guarded fragment by means of least and greatest fixed points, and thus plays the same role within the domain of guarded logics as the modal /spl mu/-calculus plays within the modal domain. We provide a semantic characterisation of /spl mu/GF within an appropriate fragment of second-order logic, in terms of invariance under guarded bisimulation. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • More past glories [temporal logic]

    Publication Year: 2000, Page(s):229 - 240
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    We continue in the same vein as O. Lichtenstein et al. (1985) in "The Glory of the Past", demonstrating the advantages of including past-time operators in using temporal logic in computer science. A normal form for temporal formulas, based on a simple combination of past formulas, is arrived at via syntactic rewrites and is shown to be a useful alternative to automata based temporal reasoning. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A complete axiomatization of interval temporal logic with infinite time

    Publication Year: 2000, Page(s):241 - 252
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (311 KB)

    Interval temporal logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to /spl omega/-regular expressions. We give a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.