Sciweavers

    2 search results - page 1 / 1
    » Product-Free Lambek Calculus Is NP-Complete
    Sort
    View
    LFCS
    2009
    Springer
    201views Artificial Intelligence» more  LFCS 2009»
    Product-Free Lambek Calculus Is NP-Complete
    13 years 11 months ago
    Product-Free Lambek Calculus Is NP-Complete
    Download  tr.cs.gc.cuny.edu
    In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a...
    Yury Savateev
    claim paper
    Read More »
    COLING
    2008
    114views Computational Linguistics» more  COLING 2008»
    Efficiently Parsing with the Product-Free Lambek Calculus
    13 years 6 months ago
    Efficiently Parsing with the Product-Free Lambek Calculus
    Download  www.aclweb.org
    Timothy A. D. Fowler
    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.