Sciweavers

    IJCAI
    2001
    125views Artificial Intelligence» more  IJCAI 2001»
    Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
    14 years 28 days ago
    Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
    Download  cs.nyu.edu
    A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
    Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
    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.