Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• item-1 hasContent marieke-van-erp.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent antske-fokkens.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent piek-vossen.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent sara-tonelli.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent willem-robert-van-hage.
• item-5 next item-6.
• item-5 previous item-4.
• item-6 type ListItem.
• item-6 hasContent luciano-serafini.
• item-6 next item-7.
• item-6 previous item-5.
• item-7 type ListItem.
• item-7 hasContent rachele-sprugnoli.
• item-7 next item-8.
• item-7 previous item-6.
• item-8 type ListItem.
• item-8 hasContent jesper-hoeksema.
• item-8 previous item-7.
• paper-10 type InProceedings.
• paper-10 label "CEDAR: a Fast Taxonomic Reasoner Based on Lattice Operations".
• paper-10 sameAs paper-10.
• paper-10 abstract "Taxonomy classification and query answering are the core reasoning services provided by most of the Semantic Web (SW) reasoners. However, the algorithms used by those reasoners are based on Tableau method or Rules. These well-known methods in the literature have already shown their limitations for large-scale reasoning.In this demonstration, we shall present the CEDAR system for classifying and reasoning on very large taxonomies using a technique based on lattice operations. This technique makes the CEDAR reasoner perform on a par with the best systems for concept classification and several orders-of-magnitude more efficiently in terms of response time for query-answering. The experiments were carried out using very large taxonomies (Wikipedia: 111599 sorts, MESH: 286381 sorts, NCBI: 903617 sorts and Biomodels: 182651 sorts). The results achieved by CEDAR were compared to those obtained by well-known Semantic Web reasoners, namely FaCT++, Pellet, HermiT, TrOWL, SnoRocket and RacerPro.".
• paper-10 hasAuthorList authorList.
• paper-10 isPartOf poster-demo-proceedings.
• paper-10 title "CEDAR: a Fast Taxonomic Reasoner Based on Lattice Operations".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasLastItem item-2.
• item-1 type ListItem.
• item-1 hasContent samir-amir.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent hassan-aiet-kaci.
• item-2 previous item-1.
• paper-11 type InProceedings.
• paper-11 label "Demonstrating The Entity Registry System: Implementing 5-Star Linked Data Without the Web".
• paper-11 sameAs paper-11.
• paper-11 abstract "Linked Data applications often assume that connectivity to data repositories and entity resolution services are always available. This may not be a valid assumption in many cases. Indeed, there are about 4.5 billion people in the world who have no or limited Web access. Many data-driven applications may have a critical impact on the life of those people, but are inaccessible to those populations due to the architecture of today's data registries. In this demonstration, we show a new open-source system that can be used as a general-purpose entity registry suitable for deployment in poorly-connected or ad-hoc environments.".
• paper-11 hasAuthorList authorList.
• paper-11 isPartOf poster-demo-proceedings.
• paper-11 title "Demonstrating The Entity Registry System: Implementing 5-Star Linked Data Without the Web".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasItem item-4.
• authorList hasItem item-5.
• authorList hasItem item-6.
• authorList hasLastItem item-6.
• item-1 type ListItem.
• item-1 hasContent marat-charlaganov.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent philippe-cudre-mauroux.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent christian-dinu.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent christophe-gueret.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent martin-grund.
• item-5 next item-6.
• item-5 previous item-4.
• item-6 type ListItem.
• item-6 hasContent teodor-macicas.
• item-6 previous item-5.
• paper-12 type InProceedings.
• paper-12 label "NoHR: Querying EL with Non-monotonic rules".
• paper-12 sameAs paper-12.
• paper-12 abstract "We present NoHR, a Protege plug-in that allows the user to take an EL ontology, add a set of non-monotonic (logic programming) rules - suitable e.g. to express defaults and exceptions - and query the combined knowledge base. Provided the given ontology alone is consistent, the system is capable of dealing with potential inconsistencies between the ontology and the rules, and, after an initial brief pre-processing period utilizing OWL 2 EL reasoner ELK, returns answers to queries at an interactive response time by means of XSB Prolog.".
• paper-12 hasAuthorList authorList.
• paper-12 isPartOf poster-demo-proceedings.
• paper-12 title "NoHR: Querying EL with Non-monotonic rules".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasLastItem item-3.
• item-1 type ListItem.
• item-1 hasContent vadim-ivanov.

• first
• previous
• next