Temporal Prepositions and Their Logic

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ian Pratt-Hartmann

11th International Symposium on Temporal Representation and Reasoning (TIME'04)

Temporal Prepositions and Their Logic (PDF)

Tatihou, Normandie, France

July 01-July 03

ISBN: 0-7695-2155-X

	ASCII Text	x
	Ian Pratt-Hartmann, "Temporal Prepositions and Their Logic," Temporal Representation and Reasoning, International Syposium on, pp. 7-8, 11th International Symposium on Temporal Representation and Reasoning (TIME'04), 2004.

	BibTex	x
	@article{ 10.1109/TIME.2004.1314412, author = {Ian Pratt-Hartmann}, title = {Temporal Prepositions and Their Logic}, journal ={Temporal Representation and Reasoning, International Syposium on}, volume = {0}, year = {2004}, issn = {1530-1311}, pages = {7-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/TIME.2004.1314412}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Temporal Representation and Reasoning, International Syposium on TI - Temporal Prepositions and Their Logic SN - 1530-1311 SP7 EP8 A1 - Ian Pratt-Hartmann, PY - 2004 KW - null VL - 0 JA - Temporal Representation and Reasoning, International Syposium on ER -

Ian Pratt-Hartmann, University of Manchester

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2004.1314412

This extended abstract reports on the computational complexity of reasoning with English sentences featuring temporal prepositions. A fragment of English featuring these constructions, called TPE, is defined by means of a context-free grammar. The phrase-structures which this grammar assigns to the sentences it recognizes can be viewed as formulas of an interval temporal logic, called TPL, whose satisfaction-conditions faithfully represent the meanings of the corresponding English sentences. It is shown that the satisfiability problem for TPL is NEXPTIME-complete.

Citation:

Ian Pratt-Hartmann, "Temporal Prepositions and Their Logic," time, pp.7-8, 11th International Symposium on Temporal Representation and Reasoning (TIME'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.