Search

Background: Multi-arm, multi-stage (MAMS) platform trials can accelerate the identification of disease-modifying treatments for Parkinson's disease (PD) but there is no current consensus on the optimal outcome measures (OM) for this approach. Objective: To provide an up-to-date inventory of OM for disease-modifying PD trials, and a framework for future selection of OM for such trials. Methods: As part of the Edmond J Safra Accelerating Clinical Trials in Parkinson Disease (EJS ACT-PD) initiative, an expert group with Patient and Public Involvement and Engagement (PPIE) representatives' input reviewed and evaluated available evidence on OM for potential use in trials to delay progression of PD. Each OM was ranked based on aspects such as validity, sensitivity to change, participant burden and practicality for a multi-site trial. Review of evidence and expert opinion led to the present inventory. Results: An extensive inventory of OM was created, divided into: general, motor and non-motor scales, diaries and fluctuation questionnaires, cognitive, disability and health-related quality of life, capability, quantitative motor, wearable and digital, combined, resource use, imaging and wet biomarkers, and milestone-based. A framework for evaluation of OM is presented to update the inventory in the future. PPIE input highlighted the need for OM which reflect their experience of disease progression and are applicable to diverse populations and disease stages. Conclusion: We present a range of OM, classified according to a transparent framework, to aid selection of OM for disease-modifying PD trials, whilst allowing for inclusion or re-classification of relevant OM as new evidence emerges. [ABSTRACT FROM AUTHOR]

The fourth paper, "Answer Selection in Community Question Answering Exploiting Knowledge Graph and Context Information" [[2]] by Golshan Afzali Boroujenia, Heshaam Failia, and Yadollah Yaghoobzadeha present a novel answer selection method that takes advantage of the knowledge embedded in KGs. Over the past years, there has been a rapid growth in the use and the importance of Knowledge Graphs (KGs) along with their application to many important tasks such as entity linking, recommender systems [[8]], etc. Link prediction within a KG is the task to find a set of links between entities (nodes) of the KG which might provide more knowledge and fill potential gaps of information. This special issue aims to reinforce the relationships between these communities and foster interdisciplinary research in the areas of KG, Deep Learning, and Natural Language Processing. [Extracted from the article]

This document is an editorial for a special issue on semantic technologies for data and algorithmic governance. It highlights the importance of technology in enabling effective governance structures and processes. The editorial poses several questions regarding privacy, transparency, bias, and trust in data and algorithmic governance systems. The special issue covers a wide range of topics, including data management, fake news identification, fairness, accountability, privacy regulations, and user-friendly interface design. The editorial also provides an overview of the papers included in the special issue, which focus on consent mechanisms, ontologies, policy languages, and privacy-preserving technologies. The papers were influenced by the General Data Protection Regulation (GDPR) and have potential applications in the proposed EU Data Governance Act and EU Artificial Intelligence (AI) Act. However, the editorial notes that more research is needed in the field of data and algorithm governance. [Extracted from the article]

Ontology matching aims at making ontologies interoperable. While the field has fully developed in the last years, most approaches are still limited to the generation of simple correspondences. More expressiveness is, however, required to better address the different kinds of ontology heterogeneities. This paper presents CANARD (Complex Alignment Need and A-box based Relation Discovery), an approach for generating expressive correspondences that rely on the notion of competency questions for alignment (CQA). A CQA expresses the user knowledge needs in terms of alignment and aims at reducing the alignment space. The approach takes as input a set of CQAs as SPARQL queries over the source ontology. The generation of correspondences is performed by matching the subgraph from the source CQA to the similar surroundings of the instances from the target ontology. Evaluation is carried out on both synthetic and real-world datasets. The impact of several approach parameters is discussed. Experiments have showed that CANARD performs, overall, better on CQA coverage than precision and that using existing same:As links, between the instances of the source and target ontologies, gives better results than exact label matches of their labels. The use of CQA improved also both CQA coverage and precision with respect to using automatically generated queries. The reassessment of the counter-example increased significantly the precision, to the detriment of runtime. Finally, experiments on large datasets showed that CANARD is one of the few systems that can perform on large knowledge bases, but depends on regularly populated knowledge bases and the quality of instance links. [ABSTRACT FROM AUTHOR]

Knowledge graph embeddings represent a group of machine learning techniques which project entities and relations of a knowledge graph to continuous vector spaces. RDF2vec is a scalable embedding approach rooted in the combination of random walks with a language model. It has been successfully used in various applications. Recently, multiple variants to the RDF2vec approach have been proposed, introducing variations both on the walk generation and on the language modeling side. The combination of those different approaches has lead to an increasing family of RDF2vec variants. In this paper, we evaluate a total of twelve RDF2vec variants on a comprehensive set of benchmark models, and compare them to seven existing knowledge graph embedding methods from the family of link prediction approaches. Besides the established GEval benchmark introducing various downstream machine learning tasks on the DBpedia knowledge graph, we also use the new DLCC (Description Logic Class Constructors) benchmark consisting of two gold standards, one based on DBpedia, and one based on synthetically generated graphs. The latter allows for analyzing which ontological patterns in a knowledge graph can actually be learned by different embedding. With this evaluation, we observe that certain tailored RDF2vec variants can lead to improved performance on different downstream tasks, given the nature of the underlying problem, and that they, in particular, have a different behavior in modeling similarity and relatedness. The findings can be used to provide guidance in selecting a particular RDF2vec method for a given task. [ABSTRACT FROM AUTHOR]

This paper presents ArtVision, a Semantic Web application that integrates computer vision APIs with the ResearchSpace platform, allowing for the matching of similar artworks and photographs across cultural heritage image collections. The field of Digital Art History stands to benefit a great deal from computer vision, as numerous projects have already made good progress in tackling issues of visual similarity, artwork classification, style detection, gesture analysis, among others. Pharos, the International Consortium of Photo Archives, is building its platform using the ResearchSpace knowledge system, an open-source semantic web platform that allows heritage institutions to publish and enrich collections as Linked Open Data through the CIDOC-CRM, and other ontologies. Using the images and artwork data of Pharos collections, this paper outlines the methodologies used to integrate visual similarity data from a number of computer vision APIs, allowing users to discover similar artworks and generate canonical URIs for each artwork. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal "Semantic Web" that focuses on the application of Semantic Web technologies in the field of Industrial Engineering. It discusses the motivations behind using Semantic Web in industrial domains, such as data management and interoperability. The document also addresses the challenges faced in implementing Semantic Web approaches in industrial settings, including knowledge representation, decision support systems, and human-machine interaction. It mentions various initiatives and projects aimed at promoting the use of Semantic Web in industrial engineering. The special issue covers topics such as Digital Twin applications, ontology development, and data analysis workflows. The document concludes by summarizing the accepted papers for the special issue, which cover topics like data modeling, knowledge graphs, and data quality governance. The authors emphasize the importance of ontologies in managing large datasets and acknowledge the challenges in ontology engineering. They also discuss the potential of ontologies in discerning semantic convergences and divergences in data, although complete interoperability is not guaranteed. [Extracted from the article]

In many industries, multiple parties collaborate on a larger project. At the same time, each of those stakeholders participates in multiple independent projects simultaneously. A double patchwork can thus be identified, with a many-to-many relationship between actors and collaborative projects. One key example is the construction industry, where every project is unique, involving specialists for many subdomains, ranging from the architectural design over technical installations to geospatial information, governmental regulation and sometimes even historical research. A digital representation of this process and its outcomes requires semantic interoperability between these subdomains, which however often work with heterogeneous and unstructured data. In this paper we propose to address this double patchwork via a decentralized ecosystem for multi-stakeholder, multi-industry collaborations dealing with heterogeneous information snippets. At its core, this ecosystem, called ConSolid, builds upon the Solid specifications for Web decentralization, but extends these both on a (meta)data pattern level and on microservice level. To increase the robustness of data allocation and filtering, we identify the need to go beyond Solid's current LDP-inspired interfaces to a Solid Pod and introduce the concept of metadata-generated 'virtual views', to be generated using an access-controlled SPARQL interface to a Pod. A recursive, scalable way to discover multi-vault aggregations is proposed, along with data patterns for connecting and aligning heterogeneous (RDF and non-RDF) resources across vaults in a mediatype-agnostic fashion. We demonstrate the use and benefits of the ecosystem using minimal running examples, concluding with the setup of an example use case from the Architecture, Engineering, Construction and Operations (AECO) industry. [ABSTRACT FROM AUTHOR]

In the materials design domain, much of the data from materials calculations is stored in different heterogeneous databases with different data and access models. Therefore, accessing and integrating data from different sources is challenging. As ontology-based access and integration alleviates these issues, in this paper we address data access and interoperability for computational materials databases by developing the Materials Design Ontology. This ontology is inspired by and guided by the OPTIMADE effort that aims to make materials databases interoperable and includes many of the data providers in computational materials science. In this paper, first, we describe the development and the content of the Materials Design Ontology. Then, we use a topic model-based approach to propose additional candidate concepts for the ontology. Finally, we show the use of the Materials Design Ontology by a proof-of-concept implementation of a data access and integration system for materials databases based on the ontology.1 This paper is an extension of (In The Semantic Web – ISWC 2020 – 19th International Semantic Web Conference, Proceedings, Part II (2000) 212–227 Springer) with results from (In ESWC Workshop on Domain Ontologies for Research Data Management in Industry Commons of Materials and Manufacturing2021 1–11) and currently unpublished results regarding an application using the ontology. [ABSTRACT FROM AUTHOR]

Maintenance of assets is a multi-million dollar cost each year for asset intensive organisations in the defence, manufacturing, resource and infrastructure sectors. These costs are tracked though maintenance work order (MWO) records. MWO records contain structured data for dates, costs, and asset identification and unstructured text describing the work required, for example 'replace leaking pump'. Our focus in this paper is on data quality for maintenance activity terms in MWO records (e.g. replace , repair , adjust and inspect). We present two contributions in this paper. First, we propose a reference ontology for maintenance activity terms. We use natural language processing to identify seven core maintenance activity terms and their synonyms from 800,000 MWOs. We provide elucidations for these seven terms. Second, we demonstrate use of the reference ontology in an application-level ontology using an industrial use case. The end-to-end NLP-ontology pipeline identifies data quality issues with 55% of the MWO records for a centrifugal pump over 8 years. For the 33% of records where a verb was not provided in the unstructured text, the ontology can infer a relevant activity class. The selection of the maintenance activity terms is informed by the ISO 14224 and ISO 15926-4 standards and conforms to ISO/IEC 21838-2 Basic Formal Ontology (BFO). The reference and application ontologies presented here provide an example for how industrial organisations can augment their maintenance work management processes with ontological workflows to improve data quality. [ABSTRACT FROM AUTHOR]

Occupant feedback enables building managers to improve occupants' health, comfort, and satisfaction. However, acquiring continuous occupant feedback and integrating this feedback with other building information is challenging. This paper presents a scalable method to acquire continuous occupant feedback and directly integrate this with other building information. Semantic web technologies were applied to solve data interoperability issues. The Occupant Feedback Ontology was developed to describe feedback semantically. Next to this, a smartwatch app – Mintal – was developed to acquire continuous feedback on indoor environmental quality. The app gathers location, medical information, and answers on short micro surveys. Mintal applied the Occupant Feedback Ontology to directly integrate the feedback with linked building data. A case study was performed to evaluate this method. A semantic digital twin was created by integrating linked building data, sensor data, and occupant feedback. Results from SPARQL queries gave more insight into an occupant's perceived comfort levels in the Open Flat. The case study shows how integrating feedback with building information allows for more occupant-centric decision support tools. The approach presented in this paper can be used in a wide range of use cases, both within and without the architecture, building, and construction domain. [ABSTRACT FROM AUTHOR]

\n Enhancing the interactions between study participants, clinicians, and investigators is imperative for advancing Parkinson’s disease (PD) research. The Canadian Open Parkinson Network (C-OPN) stands as a nationwide endeavor, connecting the PD community with ten accredited universities and movement disorders research centers spanning, at the time of this analysis, British Columbia, Alberta, Ontario, and Quebec.Our aim is to showcase C-OPN as a paradigm for bolstering national collaboration to accelerate PD research and to provide an initial overview of already collected data sets.The C-OPN database comprises de-identified data concerning demographics, symptoms and signs, treatment approaches, and standardized assessments. Additionally, it collects venous blood-derived biomaterials, such as for analyses of DNA, peripheral blood mononuclear cells (PBMC), and serum. Accessible to researchers, C-OPN resources are available through web-based data management systems for multi-center studies, including REDCap.As of November 2023, the C-OPN had enrolled 1,505 PD participants. The male-to-female ratio was 1.77:1, with 83% (n = 1098) residing in urban areas and 82% (n = 1084) having pursued post-secondary education. The average age at diagnosis was 60.2±10.3 years. Herein, our analysis of the C-OPN PD cohort encompasses environmental factors, motor and non-motor symptoms, disease management, and regional differences among provinces. As of April 2024, 32 research projects have utilized C-OPN resources.C-OPN represents a national platform promoting multidisciplinary and multisite research that focuses on PD to promote innovation, exploration of care models, and collaboration among Canadian scientists.Teamwork and communication between people living with Parkinson’s disease (PD), physicians, health professionals, and research scientists is important for improving the lives of those living with this condition. The Canadian Open Parkinson Network (C-OPN) is a Canada-wide initiative, connecting the PD community with ten accredited universities and movement disorders research centers located in – at the time of this analysis–British Columbia, Alberta, Ontario, and Quebec. The aim of this paper is to showcase C-OPN as a useful resource for physician and research scientists studying PD in Canada and around the world, and to provide snapshot of already collected data. The C-OPN database comprises de-identified (meaning removal of any identifying information, such as name or date of birth) data concerning lifestyle, disease symptoms, treatments, and results from standardized tests. It also collects blood samples for further analysis. As of November 2023, C-OPN had enrolled 1,505 PD participants across Canada. Most of the participants were male (64%), living in urban areas (83%), and completed post-secondary education (82%). The average age at diagnosis was 60.2±10.3 years. In this paper, we look at environmental factors, motor and non-motor symptoms, different disease management strategies, and regional differences between provinces. In conclusion, C-OPN represents a national platform that encourages multidisciplinary and multisite research focusing on PD to promote innovation and collaboration among Canadian scientists. [ABSTRACT FROM AUTHOR]

In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, Petri nets form a theoretically well-explored description language and are therefore often used. In this paper, we extend the eST-Miner process discovery algorithm. The eST-Miner computes a set of Petri net places which are considered to be fitting with respect to a certain fraction of the behavior described by the given event log as indicated by a given noise threshold. It evaluates all possible candidate places using token-based replay. The set of replayable traces is determined for each place in isolation, i.e., these sets do not need to be consistent. This allows the algorithm to abstract from infrequent behavioral patterns occurring only in some traces. However, when combining places into a Petri net by connecting them to the corresponding uniquely labeled transitions, the resulting net can replay exactly those traces from the event log that are allowed by the combination of all inserted places. Thus, inserting places one-by-one without considering their combined effect may result in deadlocks and low fitness of the Petri net. In this paper, we explore adaptions of the eST-Miner, that aim to select a subset of places such that the resulting Petri net guarantees a definable minimal fitness while maintaining high precision with respect to the input event log. Furthermore, current place evaluation techniques tend to block the execution of infrequent activity labels. Thus, a refined place fitness metric is introduced and thoroughly investigated. In our experiments we use real and artificial event logs to evaluate and compare the impact of the various place selection strategies and place fitness evaluation metrics on the returned Petri net. [ABSTRACT FROM AUTHOR]

The extensions of ordinary fuzzy sets are problematic because they require decimal numbers for membership, non-membership and indecision degrees of an element from the experts, which cannot be easily determined. This will be more difficult when three or more digits' membership degrees have to be assigned. Instead, proportional relations between the degrees of parameters of a fuzzy set extension will make it easier to determine the membership, non-membership, and indecision degrees. The objective of this paper is to present a simple but effective technique for determining these degrees with several decimal digits and to enable the expert to assign more stable values when asked at different time points. Some proportion-based models for the fuzzy sets extensions, intuitionistic fuzzy sets, Pythagorean fuzzy sets, picture fuzzy sets, and spherical fuzzy sets are proposed, including their arithmetic operations and aggregation operators. Proportional fuzzy sets require only the proportional relations between the parameters of the extensions of fuzzy sets. Their contribution is that these models will ease the use of fuzzy set extensions with the data better representing expert judgments. The imprecise definition of proportions is also incorporated into the given models. The application and comparative analyses result in that proportional fuzzy sets are easily applied to any problem and produce valid outcomes. Furthermore, proportional fuzzy sets clearly showed the role of the degree of indecision in the ranking of alternatives in binomial and trinomial fuzzy sets. In the considered car selection problem, it has been observed that there are minor changes in the ordering of intuitionistic and spherical fuzzy sets. [ABSTRACT FROM AUTHOR]

The interval-valued intuitionistic fuzzy sets (IVIFSs), based on the intuitionistic fuzzy sets (IFSs), combine the classical decision method and its research and application is attracting attention. After a comparative analysis, it becomes clear that multiple classical methods with IVIFSs' information have been applied to many practical issues. In this paper, we extended the classical EDAS method based on the Cumulative Prospect Theory (CPT) considering the decision experts (DEs)' psychological factors under IVIFSs. Taking the fuzzy and uncertain character of the IVIFSs and the psychological preference into consideration, an original EDAS method, based on the CPT under IVIFSs (IVIF-CPT-EDAS) method, is created for multiple-attribute group decision making (MAGDM) issues. Meanwhile, the information entropy method is used to evaluate the attribute weight. Finally, a numerical example for Green Technology Venture Capital (GTVC) project selection is given, some comparisons are used to illustrate the advantages of the IVIF-CPT-EDAS method and a sensitivity analysis is applied to prove the effectiveness and stability of this new method. [ABSTRACT FROM AUTHOR]

Virtual data integration is the current approach to go for data wrangling in data-driven decision-making. In this paper, we focus on automating schema integration, which extracts a homogenised representation of the data source schemata and integrates them into a global schema to enable virtual data integration. Schema integration requires a set of well-known constructs: the data source schemata and wrappers, a global integrated schema and the mappings between them. Based on them, virtual data integration systems enable fast and on-demand data exploration via query rewriting. Unfortunately, the generation of such constructs is currently performed in a largely manual manner, hindering its feasibility in real scenarios. This becomes aggravated when dealing with heterogeneous and evolving data sources. To overcome these issues, we propose a fully-fledged semi-automatic and incremental approach grounded on knowledge graphs to generate the required schema integration constructs in four main steps: bootstrapping, schema matching, schema integration, and generation of system-specific constructs. We also present Nextia DI , a tool implementing our approach. Finally, a comprehensive evaluation is presented to scrutinize our approach. [ABSTRACT FROM AUTHOR]

Small and medium-sized organisations face challenges in acquiring, storing and analysing personal data, particularly sensitive data (e.g., data of medical nature), due to data protection regulations, such as the GDPR in the EU, which stipulates high standards in data protection. Consequently, these organisations often refrain from collecting data centrally, which means losing the potential of data analytics and learning from aggregated user data. To enable organisations to leverage the full-potential of the collected personal data, two main technical challenges need to be addressed: (i) organisations must preserve the privacy of individual users and honour their consent, while (ii) being able to provide data and algorithmic governance, e.g., in the form of audit trails, to increase trust in the result and support reproducibility of the data analysis tasks performed on the collected data. Such an auditable, privacy-preserving data analysis is currently challenging to achieve, as existing methods and tools only offer partial solutions to this problem, e.g., data representation of audit trails and user consent, automatic checking of usage policies or data anonymisation. To the best of our knowledge, there exists no approach providing an integrated architecture for auditable, privacy-preserving data analysis. To address these gaps, as the main contribution of this paper, we propose the WellFort approach, a semantic-enabled architecture for auditable, privacy-preserving data analysis which provides secure storage for users' sensitive data with explicit consent, and delivers a trusted, auditable analysis environment for executing data analytic processes in a privacy-preserving manner. Additional contributions include the adaptation of Semantic Web technologies as an integral part of the WellFort architecture, and the demonstration of the approach through a feasibility study with a prototype supporting use cases from the medical domain. Our evaluation shows that WellFort enables privacy preserving analysis of data, and collects sufficient information in an automated way to support its auditability at the same time. [ABSTRACT FROM AUTHOR]

Knowledge graph reasoning (KGR) aims to infer new knowledge or detect noises, which is essential for improving the quality of knowledge graphs. Recently, various KGR techniques, such as symbolic- and embedding-based methods, have been proposed and shown strong reasoning ability. Symbolic-based reasoning methods infer missing triples according to predefined rules or ontologies. Although rules and axioms have proven effective, it is difficult to obtain them. Embedding-based reasoning methods represent entities and relations as vectors, and complete KGs via vector computation. However, they mainly rely on structural information and ignore implicit axiom information not predefined in KGs but can be reflected in data. That is, each correct triple is also a logically consistent triple and satisfies all axioms. In this paper, we propose a novel NeuRal Axiom Network (NeuRAN) framework that combines explicit structural and implicit axiom information without introducing additional ontologies. Specifically, the framework consists of a KG embedding module that preserves the semantics of triples and five axiom modules that encode five kinds of implicit axioms. These axioms correspond to five typical object property expression axioms defined in OWL2, including ObjectPropertyDomain, ObjectPropertyRange, DisjointObjectProperties, IrreflexiveObjectProperty and AsymmetricObjectProperty. The KG embedding module and axiom modules compute the scores that the triple conforms to the semantics and the corresponding axioms, respectively. Compared with KG embedding models and CKRL, our method achieves comparable performance on noise detection and triple classification and achieves significant performance on link prediction. Compared with TransE and TransH, our method improves the link prediction performance on the Hits@1 metric by 22.0% and 20.8% on WN18RR-10% dataset, respectively. [ABSTRACT FROM AUTHOR]

Robust estimation of concept similarity is crucial for applications of AI in the commercial, biomedical, and publishing domains, among others. While the related task of word similarity has been extensively studied, resulting in a wide range of methods, estimating concept similarity between nodes in Wikidata has not been considered so far. In light of the adoption of Wikidata for increasingly complex tasks that rely on similarity, and its unique size, breadth, and crowdsourcing nature, we propose that conceptual similarity should be revisited for the case of Wikidata. In this paper, we study a wide range of representative similarity methods for Wikidata, organized into three categories, and leverage background information for knowledge injection via retrofitting. We measure the impact of retrofitting with different weighted subsets from Wikidata and ProBase. Experiments on three benchmarks show that the best performance is achieved by pairing language models with rich information, whereas the impact of injecting knowledge is most positive on methods that originally do not consider comprehensive information. The performance of retrofitting is conditioned on the selection of high-quality similarity knowledge. A key limitation of this study, similar to prior work lies in the limited size and scope of the similarity benchmarks. While Wikidata provides an unprecedented possibility for a representative evaluation of concept similarity, effectively doing so remains a key challenge. [ABSTRACT FROM AUTHOR]

Differential privacy is a framework that provides formal tools to develop algorithms to access databases and answer statistical queries with quantifiable accuracy and privacy guarantees. The notions of differential privacy are defined independently of the data model and the query language at steak. Most differential privacy results have been obtained on aggregation queries such as counting or finding maximum or average values, and on grouping queries over aggregations such as the creation of histograms. So far, the data model used by the framework research has typically been the relational model and the query language SQL. However, effective realizations of differential privacy for SQL queries that required joins had been limited. This has imposed severe restrictions on applying differential privacy in RDF knowledge graphs and SPARQL queries. By the simple nature of RDF data, most useful queries accessing RDF graphs will require intensive use of joins. Recently, new differential privacy techniques have been developed that can be applied to many types of joins in SQL with reasonable results. This opened the question of whether these new results carry over to RDF and SPARQL. In this paper we provide a positive answer to this question by presenting an algorithm that can answer counting queries over a large class of SPARQL queries that guarantees differential privacy, if the RDF graph is accompanied with semantic information about its structure. We have implemented our algorithm and conducted several experiments, showing the feasibility of our approach for large graph databases. Our aim has been to present an approach that can be used as a stepping stone towards extensions and other realizations of differential privacy for SPARQL and RDF. [ABSTRACT FROM AUTHOR]

The acceptance of the GDPR legislation in 2018 started a new technological shift towards achieving transparency. GDPR put focus on the concept of informed consent applicable for data processing, which led to an increase of the responsibilities regarding data sharing for both end users and companies. This paper presents a literature survey of existing solutions that use semantic technology for implementing consent. The main focus is on ontologies, how they are used for consent representation and for consent management in combination with other technologies such as blockchain. We also focus on visualisation solutions aimed at improving individuals' consent comprehension. Finally, based on the overviewed state of the art we propose best practices for consent implementation. [ABSTRACT FROM AUTHOR]

In this paper, we study conditional preferences in abstract argumentation by introducing a new generalization of Dung-style argumentation frameworks (AFs) called Conditional Preference-based AFs (CPAFs). Each subset of arguments in a CPAF can be associated with its own preference relation. This generalizes existing approaches for preference-handling in abstract argumentation, and allows us to reason about conditional preferences in a general way. We conduct a principle-based analysis of CPAFs and compare them to related generalizations of AFs. Specifically, we highlight similarities and differences to Modgil's Extended AFs and show that our formalism can capture Value-based AFs. Moreover, we show that in some cases the introduction of conditional preferences leads to an increase in computational complexity. [ABSTRACT FROM AUTHOR]

Much of the formal study of algorithmic concerns with respect to semantics for abstract argumentation frameworks has focused on the issue of computational complexity. In contrast matters regarding computability have been largely neglected. Recent trends in semantics have, however, started to concentrate not so much on the formulation of novel semantics but more on identifying common properties: for example, from basic ideas such as conflict-freeness through to quite sophisticated ideas such as serializability. The aim of this paper is to look at the implications these more recent studies have for computability rather than computational complexity. [ABSTRACT FROM AUTHOR]

It is often necessary and reasonable to justify preferences before reasoning from them. Moreover, justifying a preference ordering is reduced to justifying the criterion that produces the ordering. This paper builds on the well-known ASPIC+ formalism to develop a model that integrates justifying qualitative preferences with reasoning from the justified preferences. We first introduce a notion of preference criterion in order to model the way in which preferences are justified by an argumentation framework. We also adapt the notion of argumentation theory to build a sequence of argumentation frameworks, in which an argumentation framework justifies preferences that are to underlie the next framework. That is, in our formalism, preferences become not only an input of an argumentation framework, but also an output of it. This kind of input-output process can be applied in the further steps of argumentation. We also explore some interesting properties of our formalism. [ABSTRACT FROM AUTHOR]

This paper presents a study of use of the rhetorical figure of antithesis and other contrastive relations in several modern-day environmental science policy journal articles on issues of food security, climate change, and water resource management. The articles present the conflicting perspectives of environmentalists and engineers, i.e., the view that nature should be preserved and protected versus the view that it should be engineered to solve human problems. The main contribution of this paper is a taxonomy characterizing argumentative uses of contrastive relations in these articles based on our semantic/pragmatic interpretation of text including, in some cases, discourse coherence relations. The number of examples and the breadth of the taxonomy is indicative of the key role of contrastive relations in argumentation in this genre. This investigation is a necessary step towards comprehensive computational approaches to detecting antithesis and other contrastive relations and to identifying their argumentative roles. [ABSTRACT FROM AUTHOR]

Since the inception of the Open LinguisticsWorking Group in 2010, there have been numerous efforts in transforming language resources into Linked Data. The research field of Linguistic Linked Data (LLD) has gained in importance, visibility and impact, with the Linguistic Linked Open Data (LLOD) cloud gathering nowadays over 200 resources. With this increasing growth, new challenges have emerged concerning particular domain and task applications, quality dimensions, and linguistic features to take into account. This special issue aims to review and summarize the progress and status of LLD research in recent years, as well as to offer an understanding of the challenges ahead of the field for the years to come. The papers in this issue indicate that there are still aspects to address for a wider community adoption of LLD, as well as a lack of resources for specific tasks and (interdisciplinary) domains. Likewise, the integration of LLD resources into Natural Language Processing (NLP) architectures and the search for long-term infrastructure solutions to host LLD resources continue to be essential points to which to attend in the foreseeable future of the research line. [ABSTRACT FROM AUTHOR]

This paper presents an overview of the LL(O)D and NLP methods, tools and data for detecting and representing semantic change, with its main application in humanities research. The paper's aim is to provide the starting point for the construction of a workflow and set of multilingual diachronic ontologies within the humanities use case of the COST Action Nexus Linguarum, European network for Web-centred linguistic data science, CA18209. The survey focuses on the essential aspects needed to understand the current trends and to build applications in this area of study. [ABSTRACT FROM AUTHOR]

In many industrial sectors, the current digitalization trend resulted in new products and services that exploit the potential of built-in sensors, actuators, and control systems. The business models related to these products and services usually are data-driven and integrated into digital ecosystems. Quantified products (QP) are a new product category that exploits data of individual product instances and fleets of instances. A quantified product is a product whose instances collect data about themselves that can be measured or, by design, leave traces of data. The QP design has to consider what dependencies exist between the actual product, services related to the product, and the digital ecosystem of the services. By investigating three industrial case studies, the paper contributes to a better understanding of typical features of QP and the implications of these features for the design of products and services. For this purpose, we combine the analysis of features of QP potentially affecting design with an analysis of dependencies between features. The main contributions of the work are (1) three case studies describing QP design and development, (2) a set of recurring features of QPs derived from the cases, and (3) a feature model capturing design dependencies of these features. [ABSTRACT FROM AUTHOR]