In this paper, the notion of partial completion of equational theories is proposed, which is a procedure to construct a confluent term rewriting system from an equational theory without requirement of termination cond...In this paper, the notion of partial completion of equational theories is proposed, which is a procedure to construct a confluent term rewriting system from an equational theory without requirement of termination condition. A partial completion algorithm is presented with a brief description of its application in a program development system.展开更多
At present,although knowledge graphs have been widely used in various fields such as recommendation systems,question and answer systems,and intelligent search,there are always quality problems such as knowledge omissi...At present,although knowledge graphs have been widely used in various fields such as recommendation systems,question and answer systems,and intelligent search,there are always quality problems such as knowledge omissions and errors.Quality assessment and control,as an important means to ensure the quality of knowledge,can make the applications based on knowledge graphs more complete and more accurate by reasonably assessing the knowledge graphs and fixing and improving the quality problems at the same time.Therefore,as an indispensable part of the knowledge graph construction process,the results of quality assessment and control determine the usefulness of the knowledge graph.Among them,the assessment and enhancement of completeness,as an important part of the assessment and control phase,determine whether the knowledge graph can fully reflect objective phenomena and reveal potential connections among entities.In this paper,we review specific techniques of completeness assessment and classify completeness assessment techniques in terms of closed world assumptions,open world assumptions,and partial completeness assumptions.The purpose of this paper is to further promote the development of knowledge graph quality control and to lay the foundation for subsequent research on the completeness assessment of knowledge graphs by reviewing and classifying completeness assessment techniques.展开更多
文摘In this paper, the notion of partial completion of equational theories is proposed, which is a procedure to construct a confluent term rewriting system from an equational theory without requirement of termination condition. A partial completion algorithm is presented with a brief description of its application in a program development system.
基金supported by the National Key Laboratory for Complex Systems Simulation Foundation(6142006190301)。
文摘At present,although knowledge graphs have been widely used in various fields such as recommendation systems,question and answer systems,and intelligent search,there are always quality problems such as knowledge omissions and errors.Quality assessment and control,as an important means to ensure the quality of knowledge,can make the applications based on knowledge graphs more complete and more accurate by reasonably assessing the knowledge graphs and fixing and improving the quality problems at the same time.Therefore,as an indispensable part of the knowledge graph construction process,the results of quality assessment and control determine the usefulness of the knowledge graph.Among them,the assessment and enhancement of completeness,as an important part of the assessment and control phase,determine whether the knowledge graph can fully reflect objective phenomena and reveal potential connections among entities.In this paper,we review specific techniques of completeness assessment and classify completeness assessment techniques in terms of closed world assumptions,open world assumptions,and partial completeness assumptions.The purpose of this paper is to further promote the development of knowledge graph quality control and to lay the foundation for subsequent research on the completeness assessment of knowledge graphs by reviewing and classifying completeness assessment techniques.
