Parsing as Deduction Revisited: Using an Automatic Theorem Prover to Solve an SMT Model of a Minimalist Parser

Sagar Indurkhya. Parsing as Deduction Revisited: Using an Automatic Theorem Prover to Solve an SMT Model of a Minimalist Parser. In Antske Fokkens, Vivek Srikumar, editors, Proceedings of the 26th Conference on Computational Natural Language Learning, CoNLL 2022, Abu Dhabi, United Arab Emirates (Hybrid Event), December 7-8, 2022. pages 157-175, Association for Computational Linguistics, 2022. [doi]

@inproceedings{Indurkhya22-0,
  title = {Parsing as Deduction Revisited: Using an Automatic Theorem Prover to Solve an SMT Model of a Minimalist Parser},
  author = {Sagar Indurkhya},
  year = {2022},
  url = {https://aclanthology.org/2022.conll-1.12},
  researchr = {https://researchr.org/publication/Indurkhya22-0},
  cites = {0},
  citedby = {0},
  pages = {157-175},
  booktitle = {Proceedings of the 26th Conference on Computational Natural Language Learning, CoNLL 2022, Abu Dhabi, United Arab Emirates (Hybrid Event), December 7-8, 2022},
  editor = {Antske Fokkens and Vivek Srikumar},
  publisher = {Association for Computational Linguistics},
  isbn = {978-1-959429-07-4},
}