Abstract
“以往的亲属关系推理系统,对推理的正确性无法保证,对复杂的亲属关系推理容易出错;而且难以解决多个亲属关系作为已知条件的亲属关系推理问题。本文在卢达威等(2019)的基础上,首先将推理规则和推理过程形式化和算法化;进而与基于一阶谓词逻辑的推理系统进行了对比,发现基于血缘关系结构的亲属关系推理在知识表示方法和推理规则方面都存在优势,主要表现在于执行效率更高,以及在编写和核查规则时更不容易出错;最后讨论了亲属关系推理算法的时间复杂度问题,发现该推理系统为是线性时间复杂度。本文的算法及其有效性分析得到了实验结果的支持。”- Anthology ID:
- 2023.ccl-1.42
- Volume:
- Proceedings of the 22nd Chinese National Conference on Computational Linguistics
- Month:
- August
- Year:
- 2023
- Address:
- Harbin, China
- Editors:
- Maosong Sun, Bing Qin, Xipeng Qiu, Jing Jiang, Xianpei Han
- Venue:
- CCL
- SIG:
- Publisher:
- Chinese Information Processing Society of China
- Note:
- Pages:
- 480–490
- Language:
- Chinese
- URL:
- https://aclanthology.org/2023.ccl-1.42
- DOI:
- Cite (ACL):
- Dawei Lu and Siqin Yang. 2023. 基于血缘关系结构的亲属关系推理算法研究(A Study on Kinship Inference Algorithm Based on Blood Relationship Structure). In Proceedings of the 22nd Chinese National Conference on Computational Linguistics, pages 480–490, Harbin, China. Chinese Information Processing Society of China.
- Cite (Informal):
- 基于血缘关系结构的亲属关系推理算法研究(A Study on Kinship Inference Algorithm Based on Blood Relationship Structure) (Lu & Yang, CCL 2023)
- PDF:
- https://preview.aclanthology.org/emnlp-22-attachments/2023.ccl-1.42.pdf