Sciweavers

    8 search results - page 1 / 2
    » Constructive negation by bottom-up computation of literal an...
    Sort
    View
    SAC
    2004
    ACM
    99views Applied Computing» more  SAC 2004»
    Constructive negation by bottom-up computation of literal answers
    13 years 10 months ago
    Constructive negation by bottom-up computation of literal answers
    Download  www.ecs.fullerton.edu
    Javier Álvez, Paqui Lucio, Fernando Orejas
    claim paper
    Read More »
    IJCAI
    2007
    190views Artificial Intelligence» more  IJCAI 2007»
    A New Perspective on Stable Models
    13 years 6 months ago
    A New Perspective on Stable Models
    Download  www.cs.utexas.edu
    The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
    Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
    claim paper
    Read More »
    ICLP
    2007
    Springer
    90views Automated Reasoning» more  ICLP 2007»
    Generic Tableaux for Answer Set Programming
    13 years 11 months ago
    Generic Tableaux for Answer Set Programming
    Download  www.cs.uni-potsdam.de
    Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
    Martin Gebser, Torsten Schaub
    claim paper
    Read More »
    AIEDU
    2007
    86views more  AIEDU 2007»
    A Study of Feedback Strategies in Foreign Language Classrooms and Tutorials with Implications for Intelligent Computer-Assisted
    13 years 4 months ago
    A Study of Feedback Strategies in Foreign Language Classrooms and Tutorials with Implications for Intelligent Computer-Assisted
    Download  www.era.lib.ed.ac.uk
    This paper presents two new corpus-based studies of feedback in the domain of teaching Spanish as a foreign language, concentrating on the type and frequency of different feedback ...
    Anita Ferreira, Johanna D. Moore, Chris Mellish
    claim paper
    Read More »
    LATINCRYPT
    2010
    116views Cryptology» more  LATINCRYPT 2010»
    On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
    13 years 3 months ago
    On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
    Download  www.cs.princeton.edu
    We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
    S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
    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.