The rst step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected tableau rules are presented and their usage is also exemplified in several tableau proofs. The performance of the prover is evaluated against the development data sets. The evaluation results show an extremely high precision above 97% of the prover along with a decent recall around 40%.
|Title of host publication||New Frontiers in Artificial Intelligence|
|Subtitle of host publication||JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers|
|Editors||Tsuyoshi Murata, Koji Mineshima, Daisuke Bekki|
|Number of pages||16|
|Publication status||Published - 2015|
|Name||Lecture Notes in Artificial Intelligence|
Abzianidze, L. (2015). Towards a Wide-coverage Tableau Method for Natural Logic. In T. Murata, K. Mineshima, & D. Bekki (Eds.), New Frontiers in Artificial Intelligence: JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers (Vol. 9067). (Lecture Notes in Artificial Intelligence). Springer Verlag. https://doi.org/10.1007/978-3-662-48119-6