Sciweavers

    691 search results - page 11 / 139
    » Automatically Proving Linearizability
    Sort
    View
    IJCAI
    2003
    115views Artificial Intelligence» more  IJCAI 2003»
    Practical Partition-Based Theorem Proving for Large Knowledge Bases
    13 years 11 months ago
    Practical Partition-Based Theorem Proving for Large Knowledge Bases
    Download  www.cs.toronto.edu
    Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
    Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
    claim paper
    Read More »
    IS
    2006
    135views Artificial Intelligence» more  IS 2006»
    Composition of Semantic Web services using Linear Logic theorem proving
    13 years 9 months ago
    Composition of Semantic Web services using Linear Logic theorem proving
    Download  www.idi.ntnu.no
    This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
    Jinghai Rao, Peep Küngas, Mihhail Matskin
    claim paper
    Read More »
    JAR
    2000
    97views more  JAR 2000»
    A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
    13 years 9 months ago
    A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
    Download  www.cs.wichita.edu
    We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
    Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
    claim paper
    Read More »
    POPL
    2009
    ACM
    89views Programming Languages» more  POPL 2009»
    Proving that non-blocking algorithms don't block
    14 years 10 months ago
    Proving that non-blocking algorithms don't block
    Download  www.cl.cam.ac.uk
    A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
    Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
    claim paper
    Read More »
    SP
    2005
    IEEE
    149views Security Privacy» more  SP 2005»
    Distributed Proving in Access-Control Systems
    14 years 3 months ago
    Distributed Proving in Access-Control Systems
    Download  www.ece.cmu.edu
    We present a distributed algorithm for assembling a proof that a request satisfies an access-control policy expressed in a formal logic, in the tradition of Lampson et al. [16]. ...
    Lujo Bauer, Scott Garriss, Michael K. Reiter
    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.