Rolf Schwitter
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
Rolf Schwitter has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Mehmet Ali Orgun
Macquarie University
9 shared publications - Diego Mollá
Macquarie University
4 shared publications Michael Hess
University of Zürich
3 shared publicationsSudath R. Heiyanthuduwage
School of Computing and Mathematics, Charles Sturt University, Sydney, Australia
3 shared publications- Bayzid Ashik Hossain
School of Computing, Mathematics and Engineering, Charles Sturt University, Australia
2 shared publications Fabio Rinaldi
University of Zürich
2 shared publications
Latest Publications
- Open Access
- 26 August 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (1) , 1-26
Natural Language–Based Conceptual Modelling Frameworks: State of the Art and Future Opportunities
Identifying requirements for an information system is an important task and conceptual modelling is the first step in this process. Conceptual modelling plays a critical role in the information system design process and usually involves domain experts and knowledge engineers who brainstorm together to identify the required knowledge to build an information system. The conceptual modelling process starts with the collection of necessary information from the domain experts by the knowledge engineers. Afterwards, the knowledge engineers use traditional model driven engineering techniques to design the system based on the collected information. Natural language–based conceptual modelling frameworks or systems are used to help domain experts and knowledge engineers in eliciting requirements and building conceptual models from a natural language text. In this article, we discuss the state of the art of some recent conceptual modelling frameworks that are based on natural language. We take a closer look at how these frameworks are built, in particular at the underlying motivation, architecture, types of natural language used (e.g., restricted vs. unrestricted), types of the conceptual model generated, verification support of the requirements specifications as well as the conceptual models, and underlying knowledge representation formalism. We also discuss some future research opportunities that these frameworks offer.
- 26 August 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (1) , 1-26
Open AccessNatural Language–Based Conceptual Modelling Frameworks: State of the Art and Future Opportunities
Identifying requirements for an information system is an important task and conceptual modelling is the first step in this process. Conceptual modelling plays a critical role in the information system design process and usually involves domain experts and knowledge engineers who brainstorm together to identify the required knowledge to build an information system. The conceptual modelling process starts with the collection of necessary information from the domain experts by the knowledge engineers. Afterwards, the knowledge engineers use traditional model driven engineering techniques to design the system based on the collected information. Natural language–based conceptual modelling frameworks or systems are used to help domain experts and knowledge engineers in eliciting requirements and building conceptual models from a natural language text. In this article, we discuss the state of the art of some recent conceptual modelling frameworks that are based on natural language. We take a closer look at how these frameworks are built, in particular at the underlying motivation, architecture, types of natural language used (e.g., restricted vs. unrestricted), types of the conceptual model generated, verification support of the requirements specifications as well as the conceptual models, and underlying knowledge representation formalism. We also discuss some future research opportunities that these frameworks offer.
- 6 March 2023
- Published by Taylor & Francis
- p. 512-528
Controlled Languages
Controlled languages are subsets of natural languages that use a restricted vocabulary and grammar in order to reduce or eliminate ambiguity and complexity. Some of these controlled languages are designed to improve communication between humans. Some of them make it easier for non-native speakers to read technical documentation. Some aim to improve the quality of machine translation, and another group of controlled languages serve as high-level interface languages to semantic systems where automated reasoning is important.
- 6 March 2023
- Published by Taylor & Francis
- p. 512-528
Controlled Languages
Controlled languages are subsets of natural languages that use a restricted vocabulary and grammar in order to reduce or eliminate ambiguity and complexity. Some of these controlled languages are designed to improve communication between humans. Some of them make it easier for non-native speakers to read technical documentation. Some aim to improve the quality of machine translation, and another group of controlled languages serve as high-level interface languages to semantic systems where automated reasoning is important.
- 19 March 2022
- Published by Springer Nature
- p. 291-303
User-Defined Smart Contracts Using Answer Set Programming
- 19 March 2022
- Published by Springer Nature
- p. 291-303
User-Defined Smart Contracts Using Answer Set Programming
- 4 June 2020
- Published by SAGE Publications in Journal of Information Science
- Vol. 47 (5) , 551-574
A survey on automatically constructed universal knowledge bases
A universal knowledge base can be defined as a domain-independent ontology containing instances. Ontologies define the concepts and relations among these concepts and are used to represent a domain of interest. These universal knowledge bases are the elementary units for automated reasoning on the Semantic Web. The Semantic Web is an extension of the World Wide Web which facilitates software agents to share content beyond the limitations of applications and websites. This survey focuses on the most prominent automatically constructed universal knowledge bases including KnowItAll, DBpedia, YAGO, NELL, Probase, BabelNet and Knowledge Vault. We take a closer look at how these knowledge bases are built, in particular at the information extraction and taxonomy generation process and investigate how they are used in practical applications. Due to quality concerns, the most successful and widely employed knowledge bases are manually constructed to maintain high quality, but they suffer from low coverage, high assembly and quality assurance cost. On the contrary, automatic approaches for building knowledge bases try to overcome these drawbacks. Although it is strenuous to achieve the same level of quality as for manual knowledge bases, we found that the surveyed automatically constructed knowledge bases have shown promising results and are useful for many real-world applications.
- 4 June 2020
- Published by SAGE Publications in Journal of Information Science
- Vol. 47 (5) , 551-574
A survey on automatically constructed universal knowledge bases
A universal knowledge base can be defined as a domain-independent ontology containing instances. Ontologies define the concepts and relations among these concepts and are used to represent a domain of interest. These universal knowledge bases are the elementary units for automated reasoning on the Semantic Web. The Semantic Web is an extension of the World Wide Web which facilitates software agents to share content beyond the limitations of applications and websites. This survey focuses on the most prominent automatically constructed universal knowledge bases including KnowItAll, DBpedia, YAGO, NELL, Probase, BabelNet and Knowledge Vault. We take a closer look at how these knowledge bases are built, in particular at the information extraction and taxonomy generation process and investigate how they are used in practical applications. Due to quality concerns, the most successful and widely employed knowledge bases are manually constructed to maintain high quality, but they suffer from low coverage, high assembly and quality assurance cost. On the contrary, automatic approaches for building knowledge bases try to overcome these drawbacks. Although it is strenuous to achieve the same level of quality as for manual knowledge bases, we found that the surveyed automatically constructed knowledge bases have shown promising results and are useful for many real-world applications.
- 25 November 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 153-164
Answering Why-Questions Using Probabilistic Logic Programming
- 25 November 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 153-164
Answering Why-Questions Using Probabilistic Logic Programming
- 23 August 2019
- Published by Springer Nature
- p. 500-513
Augmenting an Answer Set Based Controlled Natural Language with Temporal Expressions
- 23 August 2019
- Published by Springer Nature
- p. 500-513
Augmenting an Answer Set Based Controlled Natural Language with Temporal Expressions
- 1 May 2019
- Published by Elsevier in Information Processing & Management
- Vol. 56 (3) , 1146-1165
Real-time event detection from the Twitter data stream using the TwitterNews+ Framework
- 1 May 2019
- Published by Elsevier in Information Processing & Management
- Vol. 56 (3) , 1146-1165
Real-time event detection from the Twitter data stream using the TwitterNews+ Framework
- Open Access
- 29 January 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Specifying Weak Constraints in Processable English
- 29 January 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessSpecifying Weak Constraints in Processable English
- 1 July 2018
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 18 (3-4) , 691-705
Specifying and Verbalising Answer Set Programs in Controlled Natural Language
We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.
- 1 July 2018
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 18 (3-4) , 691-705
Specifying and Verbalising Answer Set Programs in Controlled Natural Language
We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.
- Open Access
Specifying and Verbalising Answer Set Programs in Controlled Natural Language
We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing. This paper is under consideration for acceptance in TPLP.
Open AccessSpecifying and Verbalising Answer Set Programs in Controlled Natural Language
We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing. This paper is under consideration for acceptance in TPLP.