Werner Nutt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Werner Nutt has a total of 91 co-authors. Here are the top co-authors by number of shared publications:
- Alasdair J. G. Gray
Department of Computer Science, Heriot-Watt University, Edinburgh, UK
7 shared publications - Fariz Darari
Reliable Software Engineering, Universitas Indonesia, Depok, West Java, Indonesia
6 shared publications - Radityo Eko Prasojo
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
5 shared publications Simon Razniewski
Max Planck Institute for Informatics, Saarbrücken, Germany
5 shared publications- Ognjen Savković
Free University of Bozen-Bolzano
4 shared publications - Simon Razniewski
Free University of Bozen-Bolzano
4 shared publications
Latest Publications
- 29 October 2025
- Published by Springer Nature
- p. 425-442
Compact Answers to Temporal Path Queries
- 11 September 2024
- Published by Springer Nature
- p. 124-141
Complete Approximations of Incomplete Queries
- 11 September 2024
- Published by Springer Nature
- p. 124-141
Complete Approximations of Incomplete Queries
- 13 June 2022
- Published by Springer Nature
- p. 215-223
A BERT-Based Model for Question Answering on Construction Incident Reports
- 13 June 2022
- Published by Springer Nature
- p. 215-223
A BERT-Based Model for Question Answering on Construction Incident Reports
- 14 April 2020
- Published by SAGE Publications in Semantic Web: – Interoperability, Usability, Applicability
- Vol. 11 (3) , 441-482
Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements1
RDF generally follows the open-world assumption: information is incomplete by default. Consequently, SPARQL queries cannot retrieve with certainty complete answers, and even worse, when they involve negation, it is unclear whether they produce sound
- 14 April 2020
- Published by SAGE Publications in Semantic Web: – Interoperability, Usability, Applicability
- Vol. 11 (3) , 441-482
Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements1
RDF generally follows the open-world assumption: information is incomplete by default. Consequently, SPARQL queries cannot retrieve with certainty complete answers, and even worse, when they involve negation, it is unclear whether they produce sound
- Open Access
On Expansion and Contraction of DL-Lite Knowledge Bases
Knowledge bases (KBs) are not static entities: new information constantly appears and some of the previous knowledge becomes obsolete. In order to reflect this evolution of knowledge, KBs should be expanded with the new knowledge and contracted from the obsolete one. This problem is well-studied for propositional but much less for first-order KBs. In this work we investigate knowledge expansion and contraction for KBs expressed in DL-Lite, a family of description logics (DLs) that underlie the tractable fragment OWL 2 QL of the Web Ontology Language OWL 2. We start with a novel knowledge evolution framework and natural postulates that evolution should respect, and compare our postulates to the well-established AGM postulates. We then review well-known model and formula-based approaches for expansion and contraction for propositional theories and show how they can be adapted to the case of DL-Lite. In particular, we show intrinsic limitations of model-based approaches: besides the fact that some of them do not respect the postulates we have established, they ignore the structural properties of KBs. This leads to undesired properties of evolution results: evolution of DL-Lite KBs cannot be captured in DL-Lite. Moreover, we show that well-known formula-based approaches are also not appropriate for DL-Lite expansion and contraction: they either have a high complexity of computation, or they produce logical theories that cannot be expressed in DL-Lite. Thus, we propose a novel formula-based approach that respects our principles and for which evolution is expressible in DL-Lite. For this approach we also propose polynomial time deterministic algorithms to compute evolution of DL-Lite KBs when evolution affects only factual data.
Open AccessOn Expansion and Contraction of DL-Lite Knowledge Bases
Knowledge bases (KBs) are not static entities: new information constantly appears and some of the previous knowledge becomes obsolete. In order to reflect this evolution of knowledge, KBs should be expanded with the new knowledge and contracted from the obsolete one. This problem is well-studied for propositional but much less for first-order KBs. In this work we investigate knowledge expansion and contraction for KBs expressed in DL-Lite, a family of description logics (DLs) that underlie the tractable fragment OWL 2 QL of the Web Ontology Language OWL 2. We start with a novel knowledge evolution framework and natural postulates that evolution should respect, and compare our postulates to the well-established AGM postulates. We then review well-known model and formula-based approaches for expansion and contraction for propositional theories and show how they can be adapted to the case of DL-Lite. In particular, we show intrinsic limitations of model-based approaches: besides the fact that some of them do not respect the postulates we have established, they ignore the structural properties of KBs. This leads to undesired properties of evolution results: evolution of DL-Lite KBs cannot be captured in DL-Lite. Moreover, we show that well-known formula-based approaches are also not appropriate for DL-Lite expansion and contraction: they either have a high complexity of computation, or they produce logical theories that cannot be expressed in DL-Lite. Thus, we propose a novel formula-based approach that respects our principles and for which evolution is expressible in DL-Lite. For this approach we also propose polynomial time deterministic algorithms to compute evolution of DL-Lite KBs when evolution affects only factual data.
- 1 August 2019
- Published by Elsevier in Journal of Web Semantics
- Vol. 57, 100484
On expansion and contraction of DL-Lite knowledge bases
- 1 August 2019
- Published by Elsevier in Journal of Web Semantics
- Vol. 57, 100484
On expansion and contraction of DL-Lite knowledge bases
- 24 August 2018
- Published by Springer Nature
- p. 54-71
Diagnostics of Trains with Semantic Diagnostics Rules
- 24 August 2018
- Published by Springer Nature
- p. 54-71
Diagnostics of Trains with Semantic Diagnostics Rules
- 18 July 2018
- Published by IGLC
- p. 764-774
Promoting Collaborative Construction Process Management by Means of a Normalized Workload Approach
- 18 July 2018
- Published by IGLC
- p. 764-774
Promoting Collaborative Construction Process Management by Means of a Normalized Workload Approach