The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ian Pratt-Hartmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian Pratt-Hartmann
    Total Knowledge. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:423-428 [Conf]
  2. Hans de Nivelle, Ian Pratt-Hartmann
    A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:211-225 [Conf]
  3. Ian Pratt-Hartmann
    From TimeML to TPL. [Citation Graph (0, 0)][DBLP]
    Annotating, Extracting and Reasoning about Time and Events, 2005, pp:- [Conf]
  4. Ian Pratt-Hartmann
    Temporal Prepositions and Their Logic. [Citation Graph (0, 0)][DBLP]
    TIME, 2004, pp:7-8 [Conf]
  5. Ian Pratt-Hartmann
    Temporal prepositions and their logic. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2005, v:166, n:1-2, pp:1-36 [Journal]
  6. Ian Pratt-Hartmann
    Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  7. Ian Pratt-Hartmann
    Empiricism and Rationalism in Region-based Theories of Space. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:46, n:1-2, pp:159-186 [Journal]
  8. Ian Pratt-Hartmann
    A Topological Constraint Language with Component Counting. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2002, v:12, n:3-4, pp:441-468 [Journal]
  9. Ian Pratt-Hartmann
    A Two-Variable Fragment of English. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2003, v:12, n:1, pp:13-45 [Journal]
  10. Ian Pratt-Hartmann
    Fragments of Language. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2004, v:13, n:2, pp:207-223 [Journal]
  11. Ian Pratt-Hartmann
    Complexity of the Two-Variable Fragment with Counting Quantifiers. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2005, v:14, n:3, pp:369-395 [Journal]
  12. Ian Pratt-Hartmann
    On the Complexity of the Numerically Definite Syllogistic and Related Fragments [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  13. Ian Pratt-Hartmann
    Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  14. Ian Pratt-Hartmann
    Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2007, v:17, n:1, pp:133-155 [Journal]

  15. Topology, connectedness, and modal logic. [Citation Graph (, )][DBLP]


  16. No Syllogisms for the Numerical Syllogistic. [Citation Graph (, )][DBLP]


  17. Functions Definable by Arithmetic Circuits. [Citation Graph (, )][DBLP]


  18. On the Computability of Region-Based Euclidean Logics. [Citation Graph (, )][DBLP]


  19. Interpreting Topological Logics over Euclidean Spaces. [Citation Graph (, )][DBLP]


  20. A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. [Citation Graph (, )][DBLP]


  21. On the Computational Complexity of Spatial Logics with Connectedness Constraints. [Citation Graph (, )][DBLP]


  22. The Two-Variable Fragment with Counting Revisited. [Citation Graph (, )][DBLP]


  23. On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. [Citation Graph (, )][DBLP]


  24. Data-Complexity of the Two-Variable Fragment with Counting Quantifiers [Citation Graph (, )][DBLP]


  25. Logics for the Relational Syllogistic [Citation Graph (, )][DBLP]


  26. A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics [Citation Graph (, )][DBLP]


  27. Functions Definable by Numerical Set-Expressions [Citation Graph (, )][DBLP]


  28. Complex Algebras of Arithmetic [Citation Graph (, )][DBLP]


  29. Spatial logics with connectedness predicates [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002