Sciweavers

    1462 search results - page 91 / 293
    » Autoepistemic Description Logics
    Sort
    View
    DLOG
    2010
    149views Automated Reasoning» more  DLOG 2010»
    On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
    15 years 4 months ago
    On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
    Download  www.cs.uwaterloo.ca
    Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
    C. Maria Keet
    claim paper
    Read More »
    DLOG
    2010
    109views Automated Reasoning» more  DLOG 2010»
    Second-Order Description Logics: Semantics, Motivation, and a Calculus
    15 years 4 months ago
    Second-Order Description Logics: Semantics, Motivation, and a Calculus
    Download  sisinflab.poliba.it
    Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
    claim paper
    Read More »
    DLOG
    2011
    194views Automated Reasoning» more  DLOG 2011»
    Mapping Data to Higher-Order Description Logic Knowledge Bases
    14 years 9 months ago
    Mapping Data to Higher-Order Description Logic Knowledge Bases
    Download  sunsite.informatik.rwth-aachen.de
    Floriana Di Pinto, Giuseppe De Giacomo, Maurizio L...
    claim paper
    Read More »
    DLOG
    2001
    151views Automated Reasoning» more  DLOG 2001»
    Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
    15 years 7 months ago
    Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
    Download  kogs-www.informatik.uni-hamburg.de
    This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
    Volker Haarslev, Martina Timmann, Ralf Möller
    claim paper
    Read More »
    CADE
    2004
    Springer
    114views Logical Reasoning» more  CADE 2004»
    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract
    16 years 6 months ago
    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract
    Download  users.info.unicaen.fr
    Àngel J. Gil, Bruno Zanuttini, Gernot Salze...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.