{"title":"Appropriate Expressiveness of Planning Domain Models: An Urban Traffic Control Case Study","authors":"Leah A. Chrestien, L. Chrpa","doi":"10.1145/3360901.3364437","DOIUrl":"https://doi.org/10.1145/3360901.3364437","url":null,"abstract":"The level of expressiveness of planning domain models determines their accuracy in describing real-world domains as well as their efficiency in terms of performance of planners. More expressive models might be accurate but hard for planners while less expressive models might be easier for planners but not very accurate. In this paper, we consider a problem of efficient routing of vehicles in urban road networks. We propose three domain models with different level of expressiveness to address the problem. We investigate how the models differ in terms of accuracy (quality of plans they produce) and efficiency of plan generation.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114719085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Avicenna Wisesa, Fariz Darari, Adila Alfa Krisnadhi, W. Nutt, Simon Razniewski
{"title":"Wikidata Completeness Profiling Using ProWD","authors":"Avicenna Wisesa, Fariz Darari, Adila Alfa Krisnadhi, W. Nutt, Simon Razniewski","doi":"10.1145/3360901.3364425","DOIUrl":"https://doi.org/10.1145/3360901.3364425","url":null,"abstract":"Completeness is a crucial data quality aspect that deals with the question: do we have all the data we need? The lack of awareness on the completeness state of a knowledge graph (KG) may result in bias or even falsity for any decisions made based on the KG. Given a KG, one may be wondering how its completeness may vary across different topics. In this paper, we present ProWD, a framework and tool for profiling the completeness of Wikidata, a central KG on the (Semantic) Web that is open and free to use. ProWD measures the degree of completeness based on the Class-Facet-Attribute (CFA) profiles. A class denotes a collection of entities, which can be of multiple facets, allowing attribute completeness to be analyzed and compared, e.g., how does the completeness of the attribute \"educated at\" and \"date of birth\" compare between male, German computer scientists, and female, Indonesian computer scientists? ProWD generates summaries and visualizations for such analysis, giving insights into the KG completeness. ProWD is available online at~urlhttp://prowd.id.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Capturing Themed Evidence, a Hybrid Approach","authors":"E. Daga, E. Motta","doi":"10.1145/3360901.3364415","DOIUrl":"https://doi.org/10.1145/3360901.3364415","url":null,"abstract":"The task of identifying pieces of evidence in texts is of fundamental importance in supporting qualitative studies in various domains, especially in the humanities. In this paper, we coin the expression themed evidence, to refer to (direct or indirect) traces of a fact or situation relevant to a theme of interest and study the problem of identifying them in texts. We devise a generic framework aimed at capturing themed evidence in texts based on a hybrid approach, combining statistical natural language processing, background knowledge, and Semantic Web technologies. The effectiveness of the method is demonstrated on a case study of a digital humanities database aimed at collecting and curating a repository of evidence of experiences of listening to music. Extensive experiments demonstrate that our hybrid approach outperforms alternative solutions. We also evidence its generality by testing it on a different use case in the digital humanities.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124870987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards Exploiting Generic Problem Structures in Explanations for Automated Planning","authors":"A. Lindsay","doi":"10.1145/3360901.3364419","DOIUrl":"https://doi.org/10.1145/3360901.3364419","url":null,"abstract":"Explainable AI is becoming an area of key focus in Artificial Intelligence. Within Automated Planning (AP) the area Explainable Planning (XAIP) focuses on explanations of the planning process. The relative transparency and flexibility of the planning process have been identified as key aspects suggesting that AP is well positioned to make an important contribution in Explainable AI [8]. However, there is still a wide gap between explanations that can be directly extracted from AP models and effective explanations. There are a growing number of frameworks that are considering the problem from both the user side, where it is interesting to understand the form that an explanation might take; as well as the planner side, which must be able to explain various decisions and related properties. However, approaches have focused on single domain settings, where substantial domain specific content is produced, or at a general level, where only abstract planning concepts can be used. We aim to develop an abstraction layer that sits between these and exploits the often overlapping concepts and structures that exist between many planning domains. We propose exploiting domain analysis techniques in order to identify common roles and generic problem structures (GPSs). By attaching the concepts used for explanation to these structures we can exploit the contextual information supported by the structure, and also reduce the burden of constructing explanations in domains where these structures exist. In this work we explore the opportunities for exploiting GPSs in XAIP.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122840899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jieying Chen, Ghadah Alghamdi, R. Schmidt, Dirk Walther, Yongsheng Gao
{"title":"Ontology Extraction for Large Ontologies via Modularity and Forgetting","authors":"Jieying Chen, Ghadah Alghamdi, R. Schmidt, Dirk Walther, Yongsheng Gao","doi":"10.1145/3360901.3364424","DOIUrl":"https://doi.org/10.1145/3360901.3364424","url":null,"abstract":"We are interested in the computation of ontology extracts based on forgetting from large ontologies in real-world scenarios. Such scenarios require nearly all of the terms in the ontology to be forgotten, which poses a significant challenge to forgetting tools. In this paper we show that modularization and forgetting can be combined beneficially in order to compute ontology extracts. While a module is a subset of axioms of a given ontology, the solution of forgetting (also known as a uniform interpolant) is a compact representation of the ontology limited to a subset of the signature. The approach introduced in this paper uses an iterative workflow of four stages: (i)~extension of the given signature and, if needed partitioning, (ii)~modularization, (iii)~forgetting, and (iv)~evaluation by domain expert. For modularization we use three kinds of modules: locality-based, semantic and minimal subsumption modules. For forgetting three tools are used: NUI, LETHE and FAME. An evaluation on the SNOMED CT and NCIt ontologies for standard concept name lists showed that precomputing ontology modules reduces the number of terms that need to be forgotten. An advantage of the presented approach is high precision of the computed ontology extracts.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123817898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Keynote Address","authors":"Raphael Troncy","doi":"10.1145/3372341","DOIUrl":"https://doi.org/10.1145/3372341","url":null,"abstract":"","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127082787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Antonio Lieto, G. Pozzato, Federico Perrone, Eleonora Chiodino
{"title":"Knowledge Capturing via Conceptual Reframing: A Goal-oriented Framework for Knowledge Invention","authors":"Antonio Lieto, G. Pozzato, Federico Perrone, Eleonora Chiodino","doi":"10.1145/3360901.3364422","DOIUrl":"https://doi.org/10.1145/3360901.3364422","url":null,"abstract":"In this work we describe a novel approach to goal-oriented knowledge capturing that, differently from the standard knowledge acquisition pipelines, employs a dynamic conceptual reframing mechanismrelying on a non monotonic reasoning procedure. This approachhas been implemented in a knowledge based system able to findthe solution to not directly satisfiable goals by recombining, in aninnovative way, at least two concepts of a given knowledge base(KB). The output of such combinatorial mechanism results, de facto, in an extension of the initial KB able to satisfy the original goal. The proposed approach has been tested in the task of goal-driven concept invention and has been compared with human responses.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131086662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A General Framework to Build and Assess the Quality of Authority Links","authors":"M. Chein, A. Gutierrez, M. Leclère","doi":"10.1145/3360901.3364421","DOIUrl":"https://doi.org/10.1145/3360901.3364421","url":null,"abstract":"In this paper, a methodology and generic algorithms are proposed to discover and to qualify authority links (a kind of coreference links) between entities, mentioned in descriptions of documents, and authorities, i.e., entities described in referential bases. This framework has been instantiated on the French national database Sudoc built and maintained by ABES (the French National Agency for Academic Libraries). Experiments demonstrate the effective usefulness of the tool developed using this methodology and ABES is finalizing an interactive tool for professional librarians to qualify existing links and also, if needed, to correct and complete these links.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131305747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Agustín Borrego, Daniel Ayala, Inma Hernández, Carlos R. Rivero, David Ruiz
{"title":"Generating Rules to Filter Candidate Triples for their Correctness Checking by Knowledge Graph Completion Techniques","authors":"Agustín Borrego, Daniel Ayala, Inma Hernández, Carlos R. Rivero, David Ruiz","doi":"10.1145/3360901.3364418","DOIUrl":"https://doi.org/10.1145/3360901.3364418","url":null,"abstract":"Knowledge Graphs (KGs) contain large amounts of structured information. Due to their inherent incompleteness, a process known as KG completion is often carried out to find the missing triples in a KG, usually by training a fact checking model that is able to discern between correct and incorrect knowledge. After the fact checking model has been trained and evaluated, it has to be applied to a set of candidate triples, and those that are considered correct are added to the KG as new knowledge. However, this process needs a set of candidate triples of a reasonable size that represents possible new knowledge, in order to be evaluated by the fact checking task and, if considered to be correct, added to the KG, enriching it. Current approaches for selecting candidate triples for their correctness checking either use the full set possible missing candidate triples (and thus provide no filtering) or apply very basic rules to filter out unlikely candidates, which may have a negative effect on the completion performance as very few candidate triples are filtered out. In this paper we present CHAI, a method for producing more complex rules that are able to filter candidate triples by combining a set of criteria to optimize a fitness function. Our experiments show that CHAI is able to generate rules that, when applied, yield smaller candidate sets than similar proposals while still including promising candidate triples.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133655277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Several Link Keys are Better than One, or Extracting Disjunctions of Link Key Candidates","authors":"Manuel Atencia, Jérôme David, J. Euzenat","doi":"10.1145/3360901.3364427","DOIUrl":"https://doi.org/10.1145/3360901.3364427","url":null,"abstract":"Link keys express conditions under which instances of two classes of different RDF data sets may be considered as equal. As such, they can be used for data interlinking. There exist algorithms to extract link key candidates from RDF data sets and different measures have been defined to evaluate the quality of link key candidates individually. For certain data sets, however, it may be necessary to use more than one link key on a pair of classes to retrieve a more complete set of links. To this end, in this paper, we define disjunction of link keys, propose strategies to extract disjunctions of link key candidates from RDF data, and apply existing quality measures to evaluate them. We also report on experiments with these strategies.","PeriodicalId":116830,"journal":{"name":"Proceedings of the 10th International Conference on Knowledge Capture","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122185545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}