Sciweavers

    LPNMR
    2007
    Springer
    112views Automated Reasoning» more  LPNMR 2007»
    Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
    13 years 10 months ago
    Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
    Download  www.kr.tuwien.ac.at
    Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
    Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
    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.