Sciweavers

    LATA
    2010
    Springer
    210views Artificial Intelligence» more  LATA 2010»
    Complexity of the Satisfiability Problem for a Class of Propositional Schemata
    14 years 2 months ago
    Complexity of the Satisfiability Problem for a Class of Propositional Schemata
    Download  membres-liglab.imag.fr
    Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
    Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
    claim paper
    Read More »
    « first‹ previous123
    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.