Abstract
AbstractOur goal is to develop a logic-based component for hybrid – machine learning plus logic – commonsense question answering systems. The paper presents an implementation GK of default logic for handling rules with exceptions in unrestricted first order knowledge bases. GK is built on top of our existing automated reasoning system with confidence calculation capabilities. To overcome the problem of undecidability of checking potential exceptions, GK performs delayed recursive checks with diminishing time limits. These are combined with the taxonomy-based priorities for defaults and numerical confidences.
Publisher
Springer International Publishing
Reference18 articles.
1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Alviano,2017
2. Arias, J., Carro, M., Salazar, E., Marple, K., Gupta, G.: Constraint answer set programming without grounding. Theor. Pract. Logic Program. 18(3–4), 337–354 (2018)
3. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 2, pp. 19–99. Elsevier, Amsterdam (2001)
4. Lecture Notes in Computer Science;G Brewka,1994
5. Cholewinski, P., Marek, V.W., Truszczynski, M.: Default reasoning system deres. KR 96, 518–528 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献