| tech,19-2-P99-1038,ak | of a <term> sentence </term> allows a <term> | deterministic , polynomial time test | </term> for the <term> availability of a reading | #30891 We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic , polynomial time test for the availability of a reading, while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard. |
