Querying the Fragments of English

DOI10.1007/978-3-642-20920-8_25zbMath1326.68298OpenAlexW1779328662MaRDI QIDQ3003365

Camilo Thorne

Publication date: 27 May 2011

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20920-8_25

zbMATH Keywords

satisfiabilitysemantic data complexitycomputational semanticscontrolled language interfacesknowledge base query answeringresolution proof procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Natural language processing (68T50)

This page was built for publication: Querying the Fragments of English