Sciweavers

    846 search results - page 4 / 170
    » On the Computational Complexity of Spatio-Temporal Logics
    Sort
    View
    ICTCS
    2003
    Springer
    119views Theoretical Computer Science» more  ICTCS 2003»
    On the Computational Complexity of Cut-Elimination in Linear Logic
    14 years 18 days ago
    On the Computational Complexity of Cut-Elimination in Linear Logic
    Download  www.cs.brandeis.edu
    Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
    Harry G. Mairson, Kazushige Terui
    claim paper
    Read More »
    FCT
    2003
    Springer
    90views Applied Computing» more  FCT 2003»
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
    14 years 18 days ago
    On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
    Download  www.ida.liu.se
    Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
    Andrzej Szalas
    claim paper
    Read More »
    LICS
    2006
    IEEE
    89views Automated Reasoning» more  LICS 2006»
    Context Semantics, Linear Logic and Computational Complexity
    14 years 1 months ago
    Context Semantics, Linear Logic and Computational Complexity
    Download  tocl.acm.org
    Ugo Dal Lago
    claim paper
    Read More »
    ICLP
    1992
    Springer
    86views Automated Reasoning» more  ICLP 1992»
    Complexity of Computing with Extended Propositional Logic Programs
    13 years 11 months ago
    Complexity of Computing with Extended Propositional Logic Programs
    Download  www.cs.uky.edu
    V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszcz...
    claim paper
    Read More »
    IGPL
    2000
    82views more  IGPL 2000»
    The Computational Complexity of Hybrid Temporal Logics
    13 years 7 months ago
    The Computational Complexity of Hybrid Temporal Logics
    Download  www.loria.fr
    Carlos Areces, Patrick Blackburn, Maarten Marx
    claim paper
    Read More »
    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.