Sciweavers

    LICS
    1997
    IEEE
    139views Automated Reasoning» more  LICS 1997»
    On the Complexity of Reasoning in Kleene Algebra
    13 years 8 months ago
    On the Complexity of Reasoning in Kleene Algebra
    Download  www.cs.cornell.edu
    Dexter Kozen
    claim paper
    Read More »
    LICS
    1997
    IEEE
    174views Automated Reasoning» more  LICS 1997»
    The Complexity of Subtype Entailment for Simple Types
    13 years 8 months ago
    The Complexity of Subtype Entailment for Simple Types
    Download  www.diku.dk
    A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
    Fritz Henglein, Jakob Rehof
    claim paper
    Read More »
    LICS
    1997
    IEEE
    84views Automated Reasoning» more  LICS 1997»
    Complete Cuboidal Sets in Axiomatic Domain Theory
    13 years 8 months ago
    Complete Cuboidal Sets in Axiomatic Domain Theory
    Download  homepages.inf.ed.ac.uk
    Marcelo P. Fiore, Gordon D. Plotkin, A. John Power
    claim paper
    Read More »
    LICS
    1997
    IEEE
    119views Automated Reasoning» more  LICS 1997»
    First-Order Logic with Two Variables and Unary Temporal Logic
    13 years 8 months ago
    First-Order Logic with Two Variables and Unary Temporal Logic
    Download  www.brics.dk
    Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
    claim paper
    Read More »
    LICS
    1997
    IEEE
    94views Automated Reasoning» more  LICS 1997»
    Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
    13 years 8 months ago
    Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
    Download  www.cs.bham.ac.uk
    The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
    Martín Hötzel Escardó, Thomas S...
    claim paper
    Read More »
    LICS
    1997
    IEEE
    73views Automated Reasoning» more  LICS 1997»
    Ground Reducibility is EXPTIME-Complete
    13 years 8 months ago
    Ground Reducibility is EXPTIME-Complete
    Download  www.lsv.ens-cachan.fr
    Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
    Hubert Comon, Florent Jacquemard
    claim paper
    Read More »
    LICS
    1997
    IEEE
    110views Automated Reasoning» more  LICS 1997»
    A Kleene Theorem for Timed Automata
    13 years 8 months ago
    A Kleene Theorem for Timed Automata
    Download  www-verimag.imag.fr
    Eugene Asarin, Paul Caspi, Oded Maler
    claim paper
    Read More »
    LICS
    1997
    IEEE
    111views Automated Reasoning» more  LICS 1997»
    Bisimulation for Labelled Markov Processes
    13 years 8 months ago
    Bisimulation for Labelled Markov Processes
    Download  www.brics.dk
    Richard Blute, Josee Desharnais, Abbas Edalat, Pra...
    claim paper
    Read More »
    « first‹ previous12
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.