52 research outputs found
OWL Reasoners still useable in 2023
In a systematic literature and software review over 100 OWL reasoners/systems
were analyzed to see if they would still be usable in 2023. This has never been
done in this capacity. OWL reasoners still play an important role in knowledge
organisation and management, but the last comprehensive surveys/studies are
more than 8 years old. The result of this work is a comprehensive list of 95
standalone OWL reasoners and systems using an OWL reasoner. For each item,
information on project pages, source code repositories and related
documentation was gathered. The raw research data is provided in a Github
repository for anyone to use
Scalable Reasoning for Knowledge Bases Subject to Changes
ScienceWeb is a semantic web system that collects information about a research community and allows users to ask qualitative and quantitative questions related to that information using a reasoning engine. The more complete the knowledge base is, the more helpful answers the system will provide. As the size of knowledge base increases, scalability becomes a challenge for the reasoning system. As users make changes to the knowledge base and/or new information is collected, providing fast enough response time (ranging from seconds to a few minutes) is one of the core challenges for the reasoning system.
There are two basic inference methods commonly used in first order logic: forward chaining and backward chaining. As a general rule, forward chaining is a good method for a static knowledge base and backward chaining is good for the more dynamic cases. The goal of this thesis was to design a hybrid reasoning architecture and develop a scalable reasoning system whose efficiency is able to meet the interaction requirements in a ScienceWeb system when facing a large and evolving knowledge base.
Interposing a backward chaining reasoner between an evolving knowledge base and a query manager with support of trust yields an architecture that can support reasoning in the face of frequent changes. An optimized query-answering algorithm, an optimized backward chaining algorithm and a trust-based hybrid reasoning algorithm are three key algorithms in such an architecture. Collectively, these three algorithms are significant contributions to the field of backward chaining reasoners over ontologies.
I explored the idea of trust in the trust-based hybrid reasoning algorithm, where each change to the knowledge base is analyzed as to what subset of the knowledge base is impacted by the change and could therefore contribute to incorrect inferences. I adopted greedy ordering and deferring joins in optimized query-answering algorithm. I introduced four optimizations in the algorithm for backward chaining. These optimizations are: 1) the implementation of the selection function, 2) the upgraded substitute function, 3) the application of OLDT and 4) solving of the owl: sameAs problem.
I evaluated our optimization techniques by comparing the results with and without optimization techniques. I evaluated our optimized query answering algorithm by comparing to a traditional backward-chaining reasoner. I evaluated our trust-based hybrid reasoning algorithm by comparing the performance of a forward chaining algorithm to that of a pure backward chaining algorithm. The evaluation results have shown that the hybrid reasoning architecture with the scalable reasoning system is able to support scalable reasoning of ScienceWeb to answer qualitative questions effectively when facing both a fixed knowledge base and an evolving knowledge base
A survey of current, stand-alone OWL Reasoners
Abstract. We present a survey of the current OWL reasoner landscape. Through literature and web search we have identified 35 OWL reasoners that are, at least to some degree, actively maintained. We conducted a survey directly addressing the respective developers, and collected 33 responses. We present an analysis of the survey, characterising all reasoners across a wide range of categories such as supported expressiveness and reasoning services. We will also provide some insight about ongoing research efforts and a rough categorisation of reasoner calculi
Tractable approximate deduction for OWL
Acknowledgements This work has been partially supported by the European project Marrying Ontologies and Software Technologies (EU ICT2008-216691), the European project Knowledge Driven Data Exploitation (EU FP7/IAPP2011-286348), the UK EPSRC project WhatIf (EP/J014354/1). The authors thank Prof. Ian Horrocks and Dr. Giorgos Stoilos for their helpful discussion on role subsumptions. The authors thank Rafael S. Gonçalves et al. for providing their hotspots ontologies. The authors also thank BoC-group for providing their ADOxx Metamodelling ontologies.Peer reviewedPostprin
Semantic Management of Location-Based Services in Wireless Environments
En los últimos años el interés por la computación móvil ha crecido debido al incesante uso de dispositivos móviles (por ejemplo, smartphones y tablets) y su ubicuidad. El bajo coste de dichos dispositivos unido al gran número de sensores y mecanismos de comunicación que equipan, hace posible el desarrollo de sistemas de información útiles para sus usuarios. Utilizando un cierto tipo especial de sensores, los mecanismos de posicionamiento, es posible desarrollar Servicios Basados en la Localización (Location-Based Services o LBS en inglés) que ofrecen un valor añadido al considerar la localización de los usuarios de dispositivos móviles para ofrecerles información personalizada. Por ejemplo, se han presentado numerosos LBS entre los que se encuentran servicios para encontrar taxis, detectar amigos en las cercanías, ayudar a la extinción de incendios, obtener fotos e información de los alrededores, etc. Sin embargo, los LBS actuales están diseñados para escenarios y objetivos específicos y, por lo tanto, están basados en esquemas predefinidos para el modelado de los elementos involucrados en estos escenarios. Además, el conocimiento del contexto que manejan es implícito; razón por la cual solamente funcionan para un objetivo específico. Por ejemplo, en la actualidad un usuario que llega a una ciudad tiene que conocer (y comprender) qué LBS podrían darle información acerca de medios de transporte específicos en dicha ciudad y estos servicios no son generalmente reutilizables en otras ciudades. Se han propuesto en la literatura algunas soluciones ad hoc para ofrecer LBS a usuarios pero no existe una solución general y flexible que pueda ser aplicada a muchos escenarios diferentes. Desarrollar tal sistema general simplemente uniendo LBS existentes no es sencillo ya que es un desafío diseñar un framework común que permita manejar conocimiento obtenido de datos enviados por objetos heterogéneos (incluyendo datos textuales, multimedia, sensoriales, etc.) y considerar situaciones en las que el sistema tiene que adaptarse a contextos donde el conocimiento cambia dinámicamente y en los que los dispositivos pueden usar diferentes tecnologías de comunicación (red fija, inalámbrica, etc.). Nuestra propuesta en la presente tesis es el sistema SHERLOCK (System for Heterogeneous mobilE Requests by Leveraging Ontological and Contextual Knowledge) que presenta una arquitectura general y flexible para ofrecer a los usuarios LBS que puedan serles interesantes. SHERLOCK se basa en tecnologías semánticas y de agentes: 1) utiliza ontologías para modelar la información de usuarios, dispositivos, servicios, y el entorno, y un razonador para manejar estas ontologías e inferir conocimiento que no ha sido explicitado; 2) utiliza una arquitectura basada en agentes (tanto estáticos como móviles) que permite a los distintos dispositivos SHERLOCK intercambiar conocimiento y así mantener sus ontologías locales actualizadas, y procesar peticiones de información de sus usuarios encontrando lo que necesitan, allá donde esté. El uso de estas dos tecnologías permite a SHERLOCK ser flexible en términos de los servicios que ofrece al usuario (que son aprendidos mediante la interacción entre los dispositivos), y de los mecanismos para encontrar la información que el usuario quiere (que se adaptan a la infraestructura de comunicación subyacente)
Automatically selecting patients for clinical trials with justifications
Clinical trials are human research studies that are used to evaluate the effectiveness
of a surgical, medical, or behavioral intervention. They have been widely used by researchers
to determine whether a new treatment, such as a new medication, is safe and
effective in humans. A clinical trial is frequently performed to determine whether a new
treatment is more successful than the current treatment or has less harmful side effects.
However, clinical trials have a high failure rate. One method applied is to find patients
based on patient records. Unfortunately, this is a difficult process. This is because this
process is typically performed manually, making it time-consuming and error-prone.
Consequently, clinical trial deadlines are often missed, and studies do not move forward.
Time can be a determining factor for success. Therefore, it would be advantageous to have
automatic support in this process. Since it is also important to be able to validate whether
the patients were selected correctly for the trial, avoiding eventual health problems, it
would be important to have a mechanism to present justifications for the selected patients.
In this dissertation, we present one possible solution to solve the problem of patient
selection for clinical trials. We developed the necessary algorithms and created a simple
and intuitive web application that features the selection of patients for clinical trials automatically.
This was achieved by combining knowledge expressed in different formalisms.
We integrated medical knowledge using ontologies, with criteria that were expressed
using nonmonotonic rules. To address the validation procedure automatically, we developed
a mechanism that generates the justifications for each selection together with the
results of the patients who were selected.
In the end, it is expected that a user can easily enter a set of trial criteria, and the
application will generate the results of the selected patients and their respective justifications,
based on the criteria inserted, medical information and a database of patient
information.Os ensaios clínicos são estudos de pesquisa em humanos, utilizados para avaliar a
eficácia de uma intervenção cirúrgica, médica ou comportamental. Estes estudos, têm
sido amplamente utilizados pelos investigadores para determinar se um novo tratamento,
como é o caso de um novo medicamento, é seguro e eficaz em humanos. Um ensaio clínico
é realizado frequentemente, para determinar se um novo tratamento tem mais sucesso
do que o tratamento atual ou se tem menos efeitos colaterais prejudiciais.
No entanto, os ensaios clínicos têm uma taxa de insucesso alta. Um método aplicado
é encontrar pacientes com base em registos. Infelizmente, este é um processo difícil.
Isto deve-se ao facto deste processo ser normalmente realizado à mão, o que o torna
demorado e propenso a erros. Consequentemente, o prazo dos ensaios clínicos é muitas
vezes ultrapassado e os estudos acabam por não avançar. O tempo pode ser por vezes um
fator determinante para o sucesso. Seria então vantajoso ter algum apoio automático neste
processo. Visto que também seria importante validar se os pacientes foram selecionados
corretamente para o ensaio, evitando até eventuais problemas de saúde, seria importante
ter um mecanismo que apresente justificações para os pacientes selecionados.
Nesta dissertação, apresentamos uma possível solução para resolver o problema da
seleção de pacientes para ensaios clínicos, através da criação de uma aplicação web, intuitiva
e fácil de utilizar, que apresenta a seleção de pacientes para ensaios clínicos de
forma automática. Isto foi alcançado através da combinação de conhecimento expresso
em diferentes formalismos. Integrámos o conhecimento médico usando ontologias, com
os critérios que serão expressos usando regras não monotónicas. Para tratar do processo
de validação, desenvolvemos um mecanismo que gera justificações para cada seleção
juntamente com os resultados dos pacientes selecionados.
No final, é esperado que o utilizador consiga inserir facilmente um conjunto de critérios
de seleção, e a aplicação irá gerar os resultados dos pacientes selecionados e as
respetivas justificações, com base nos critérios inseridos, informações médicas e uma base
de dados com informações dos pacientes
- …