Sciweavers

    50 search results - page 5 / 10
    » dlog 2008
    Sort
    View
    DLOG
    2008
    91views Automated Reasoning» more  DLOG 2008»
    ContraBovemRufum: A System for Probabilistic Lexicographic Entailment
    13 years 10 months ago
    ContraBovemRufum: A System for Probabilistic Lexicographic Entailment
    Download  sunsite.informatik.rwth-aachen.de
    Representing probabilistic knowledge in combination with a description logic has been a research topic for quite some time. In [1] one of such combinations is introduced. We presen...
    Tobias Henrik Näth, Ralf Möller
    claim paper
    Read More »
    DLOG
    2008
    180views Automated Reasoning» more  DLOG 2008»
    Essential and Mandatory Part-Whole Relations in Conceptual Data Models
    13 years 10 months ago
    Essential and Mandatory Part-Whole Relations in Conceptual Data Models
    Download  www.meteck.org
    A recurring problem in conceptual modelling and ontology development is the representation of part-whole relations, with a requirement to be able to distinguish between essential a...
    Alessandro Artale, C. Maria Keet
    claim paper
    Read More »
    DLOG
    2008
    103views Automated Reasoning» more  DLOG 2008»
    Checking DL-Lite Modularity with QBF Solvers
    13 years 10 months ago
    Checking DL-Lite Modularity with QBF Solvers
    Download  sunsite.informatik.rwth-aachen.de
    We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
    Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
    claim paper
    Read More »
    DLOG
    2008
    119views Automated Reasoning» more  DLOG 2008»
    Two Upper Bounds for Conjunctive Query Answering in SHIQ
    13 years 10 months ago
    Two Upper Bounds for Conjunctive Query Answering in SHIQ
    Download  sunsite.informatik.rwth-aachen.de
    We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NEx...
    Carsten Lutz
    claim paper
    Read More »
    DLOG
    2008
    88views Automated Reasoning» more  DLOG 2008»
    A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
    13 years 10 months ago
    A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
    Download  sunsite.informatik.rwth-aachen.de
    Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest f...
    Franz Baader, Novak Novakovik, Boontawee Suntisriv...
    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.