Matches in ScholarlyData for { ?s ?p ?o. }
- 307 abstract "The Rule Interchange Format Production Rule Dialect (RIF-PRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operationally via labeled terminal transition systems. In this paper, we introduce a declarative logical characterization of the full default semantics of RIF-PRD based on Answer Set Programming (ASP), including matching, conflict resolution and acting. Our proposal to the semantics of RIF-PRD enjoys several features. Being based on ASP, it enables a straightforward integration with Logic Pro- gramming rule based technology, namely for reasoning and acting with ontologies. Then, its full declarative logical character facilitates the in- vestigation of formal properties of RIF-PRD itself. Furthermore, it turns out that our characterization based on ASP is flexible enough so that new conflict resolution semantics for RIF-PRD can easily be defined and encoded. Finally, it immediately serves as the declarative specification of an implementation, whose prototype we developed.".
- 307 hasAuthorList authorList.
- 307 isPartOf proceedings.
- 307 keyword "semantic web".
- 307 title "Declarative Semantics for the Rule Interchange Format Production Rule Dialect".
- 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 carlos-viegas-damasio.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jose-julio-alferes.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent joao-leite.
- item-3 previous item-2.
- 317 creator ignazio-palmisano.
- 317 creator paul-doran.
- 317 creator terry-payne.
- 317 creator valentina-tamma.
- 317 type InProceedings.
- 317 label "Deciding Agent Orientation on Ontology Mappings".
- 317 sameAs 317.
- 317 abstract "Effective communication in open environments relies on the ability of agents to reach a mutual understanding of the exchanged message by reconciling the vocabulary (ontology) used. Various approaches have considered how mutually acceptable mappings between corresponding concepts in the agents' own ontologies may be determined dynami- cally through argumentation-based negotiation (such as Meaning-based Argumentation, MbA). In this paper we present a novel approach to the dynamic determination of mutually acceptable mappings, that allows agents to express a private acceptability threshold over the types of mappings they prefer. We empirically compare this approach with the Meaning-based Argumentation and demonstrate that the proposed approach produces larger agreed alignments thus better enabling agent communication. Furthermore, we compare and evaluate the fitness for purpose of the generated alignments, and we empirically demonstrate that the proposed approach has comparable performance to the MbA approach.".
- 317 hasAuthorList authorList.
- 317 isPartOf proceedings.
- 317 keyword "semantic web".
- 317 title "Deciding Agent Orientation on Ontology Mappings".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent paul-doran.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent terry-payne.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent valentina-tamma.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent ignazio-palmisano.
- item-4 previous item-3.
- 318 creator deborah-mcguinness.
- 318 creator joshua-shinavier.
- 318 creator li-ding.
- 318 creator zhenning-shangguan.
- 318 type InProceedings.
- 318 label "SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data".
- 318 sameAs 318.
- 318 abstract "Millions of owl:sameAs statements have been published on the Web of Data. Due to its unique role and heavy usage in Linked Data integration, owl:sameAs has become a topic of increasing interest and debate. This paper provides a quantitative analysis of owl:sameAs deployment status and uses these statistics to focus discussion around its usage in Linked Data.".
- 318 hasAuthorList authorList.
- 318 isPartOf proceedings.
- 318 keyword "linked data".
- 318 keyword "network".
- 318 keyword "owl:sameas".
- 318 keyword "semantic web".
- 318 title "SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent li-ding.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent joshua-shinavier.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent zhenning-shangguan.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent deborah-mcguinness.
- item-4 previous item-3.
- 319 creator abraham-bernstein.
- 319 creator philip-stutz.
- 319 creator william-cohen.
- 319 type InProceedings.
- 319 label "Signal/Collect: Graph Algorithms for the (Semantic) Web".
- 319 sameAs 319.
- 319 abstract "The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confronts researchers with a conundrum: Whilst the data is available the programming models that facilitate scalability and the infrastructure to run various algorithms on the graph are missing. Some use MapReduce - a good solution for many problems. However, even some simple iterative graph algorithms do not map nicely to that programming model requiring programmers to shoehorn their problem to the MapReduce model. This paper presents the Signal/Collect programming model for synchronous and asynchronous graph algorithms. We demonstrate that this abstraction can capture the essence of many algorithms on graphs in a concise and elegant way by giving Signal/Collect adaptations of various relevant algorithms. Furthermore, we built and evaluated a prototype Signal/Collect framework that executes algorithms in our pro- gramming model. We empirically show that this prototype transpar- ently scales and that guiding computations by scoring as well as asyn- chronicity can greatly improve the convergence of some example algorithms. We released the framework under the Apache License 2.0 (at http://www.ifi.uzh.ch/ddis/research/sc).".
- 319 hasAuthorList authorList.
- 319 isPartOf proceedings.
- 319 keyword "semantic web".