Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ian Pratt-Hartmann
Ian E. Pratt
2010 – today
- 2013
[j22]- 2012
- [j21]
- [c17]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera: Two-Variable First-Order Logic with Equivalence Closure. LICS 2012: 431-440
- 2011
- [j20]Ian Pratt-Hartmann: The Hamiltonian Syllogistic. Journal of Logic, Language and Information 20(4): 445-474 (2011)
- [c16]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev: On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. IJCAI 2011: 957-962
- [i12]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev: On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. CoRR abs/1104.0219 (2011)
- [i11]
- [i10]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev: Topological Logics with Connectedness over Euclidean Spaces. CoRR abs/1110.4034 (2011)
- 2010
- [j19]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev: Spatial logics with connectedness predicates. Logical Methods in Computer Science 6(3) (2010)
- [c15]Yavor Nenov, Ian Pratt-Hartmann: On the Computability of Region-Based Euclidean Logics. CSL 2010: 439-453
- [c14]Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev: Interpreting Topological Logics over Euclidean Spaces. KR 2010
- [c13]Angelo Montanari, Ian Pratt-Hartmann, Pietro Sala: Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders. TIME 2010: 27-34
- [c12]
- [i9]
2000 – 2009
- 2009
- [j18]Ivo Düntsch, Ian Pratt-Hartmann: Complex Algebras of Arithmetic. Fundam. Inform. 97(4): 347-367 (2009)
- [j17]Ian Pratt-Hartmann: Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput. 207(8): 867-888 (2009)
- [c11]Ian Pratt-Hartmann: No Syllogisms for the Numerical Syllogistic. Languages: From Formal to Natural 2009: 192-203
- [c10]
- [c9]Yevgeny Kazakov, Ian Pratt-Hartmann: A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS 2009: 407-416
- [i8]Yevgeny Kazakov, Ian Pratt-Hartmann: A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. CoRR abs/0905.3108 (2009)
- [i7]Ian Pratt-Hartmann, Ivo Düntsch: Functions Definable by Numerical Set-Expressions. CoRR abs/0911.0105 (2009)
- [i6]
- 2008
- [j16]Ian Pratt-Hartmann: On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. Bulletin of Symbolic Logic 14(1): 1-28 (2008)
- [j15]Ian Pratt-Hartmann: Conditionalization and total knowledge. Journal of Applied Non-Classical Logics 18(2-3): 247-266 (2008)
- [c8]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev: Topology, connectedness, and modal logic. Advances in Modal Logic 2008: 151-176
- [c7]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev: On the Computational Complexity of Spatial Logics with Connectedness Constraints. LPAR 2008: 574-589
- [i5]Ian Pratt-Hartmann: Data-Complexity of the Two-Variable Fragment with Counting Quantifiers. CoRR abs/0806.1636 (2008)
- [i4]Ian Pratt-Hartmann, Lawrence S. Moss: Logics for the Relational Syllogistic. CoRR abs/0808.0521 (2008)
- 2007
- [e2]Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem (Eds.): Handbook of Spatial Logics. Springer 2007, ISBN 978-1-4020-5586-7
- [j14]Ian Pratt-Hartmann: Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. J. Log. Comput. 17(1): 133-155 (2007)
- [p2]Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem: What is Spatial Logic? Handbook of Spatial Logics 2007: 1-11
- [p1]
- [i3]Ian Pratt-Hartmann: On the Complexity of the Numerically Definite Syllogistic and Related Fragments. CoRR abs/cs/0701039 (2007)
- 2006
- [j13]Ian Pratt-Hartmann, Allan Third: More Fragments of Language. Notre Dame Journal of Formal Logic 47(2): 151-177 (2006)
- [i2]Ian Pratt-Hartmann: Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers. CoRR abs/cs/0601112 (2006)
- 2005
- [j12]
- [j11]Ian Pratt-Hartmann: Complexity of the Two-Variable Fragment with Counting Quantifiers. Journal of Logic, Language and Information 14(3): 369-395 (2005)
- [c6]Ian Pratt-Hartmann: From TimeML to TPL. Annotating, Extracting and Reasoning about Time and Events 2005
- [e1]Renate A. Schmidt, Ian Pratt-Hartmann, Mark Reynolds, Heinrich Wansing (Eds.): Advances in Modal Logic 5, papers from the fifth conference on "Advances in Modal logic," held in Manchester (UK) in September 2004. King's College Publications 2005, ISBN 1-904987-22-2
- 2004
- [j10]Ian Pratt-Hartmann: Fragments of Language. Journal of Logic, Language and Information 13(2): 207-223 (2004)
- [c5]
- [i1]Ian Pratt-Hartmann: Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers. CoRR cs.LO/0411031 (2004)
- 2003
- [j9]Ian Pratt-Hartmann: A Two-Variable Fragment of English. Journal of Logic, Language and Information 12(1): 13-45 (2003)
- 2002
- [j8]Ian Pratt-Hartmann: A Topological Constraint Language with Component Counting. Journal of Applied Non-Classical Logics 12(3-4): 441-468 (2002)
- [j7]Ian Pratt-Hartmann, Dominik J. Schoop: Elementary Polyhedral Mereotopology. J. Philosophical Logic 31(5): 469-498 (2002)
- 2001
- [j6]Ian Pratt-Hartmann: Empiricism and Rationalism in Region-based Theories of Space. Fundam. Inform. 46(1-2): 159-186 (2001)
- [c4]Hans de Nivelle, Ian Pratt-Hartmann: A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. IJCAR 2001: 211-225
- 2000
- [j5]Ian E. Pratt, Dominik J. Schoop: Expressivity in Polygonal, Plane Mereotopology. J. Symb. Log. 65(2): 822-838 (2000)
- [c3]
1990 – 1999
- 1999
- [j4]Oliver Lemon, Ian E. Pratt: Logics for geographic information. Journal of Geographical Systems 1(1): 75-90 (1999)
- 1998
- [j3]Oliver Lemon, Ian E. Pratt: On the Insufficiency of Linear Diagrams for Syllogisms. Notre Dame Journal of Formal Logic 39(4): 573-580 (1998)
- [j2]Oliver Lemon, Ian E. Pratt: Complete Logics for QSR: A Guide to Plane Meretopology. J. Vis. Lang. Comput. 9(1): 5-21 (1998)
- 1997
- [j1]Ian E. Pratt, Oliver Lemon: Ontologies for Plane, Polygonal Mereotopology. Notre Dame Journal of Formal Logic 38(2): 225-245 (1997)
- 1994
- [c2]Ian E. Pratt, David S. Brée: The Expressive Power of the English Temporal Preposition System. TIME 1994: 153-160
- 1993
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:40 CEST by the dblp team