sign in · help · news · about ·

BibSonomy :: author :: Pratt-Hartmann ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(44)

<< < 1 | 2 | 3 > >>

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.
Yevgeny Kazakov, and Ian Pratt-Hartmann LICS, page 407-416. IEEE Computer Society, (2009)
to dblp by dblp and 1 other user on Jan 20, 2012, 12:00 AM
URL | BibTeX
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann CoRR (2006)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, and Michael Zakharyaschev CoRR (2011)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
Complex Algebras of Arithmetic
Ivo Düntsch, and Ian Pratt-Hartmann CoRR (2009)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
Functions Definable by Numerical Set-Expressions
Ian Pratt-Hartmann, and Ivo Düntsch CoRR (2009)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Logics for the Relational Syllogistic
Ian Pratt-Hartmann, and Lawrence S. Moss CoRR (2008)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Complexity of the Two-Variable Fragment with Binary-Coded Counting Quantifiers
Ian Pratt-Hartmann CoRR (2004)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Ian Pratt-Hartmann CoRR (2007)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Topological Logics with Connectedness over Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, and Michael Zakharyaschev CoRR (2011)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
The Syllogistic with Unity
Ian Pratt-Hartmann CoRR (2011)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Yevgeny Kazakov, and Ian Pratt-Hartmann CoRR (2009)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
The Hamiltonian Syllogistic
Ian Pratt-Hartmann CoRR (2010)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann CoRR (2008)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
The Hamiltonian Syllogistic.
Ian Pratt-Hartmann Journal of Logic, Language and Information 20(4):445-474 (2011)
to dblp by dblp on Sep 22, 2011, 12:00 AM
URL | BibTeX
Empiricism and Rationalism in Region-based Theories of Space.
Ian Pratt-Hartmann Fundam. Inform. 46(1-2):159-186 (2001)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces.
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, and Michael Zakharyaschev IJCAI, page 957-962. IJCAI/AAAI, (2011)
to dblp by dblp and 1 other user on Aug 9, 2011, 12:00 AM
URL | BibTeX
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality.
Hans de Nivelle, and Ian Pratt-Hartmann IJCAR, volume 2083 of Lecture Notes in Computer Science, page 211-225. Springer, (2001)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
A Two-Variable Fragment of English.
Ian Pratt-Hartmann Journal of Logic, Language and Information 12(1):13-45 (2003)
to dblp by dblp on May 26, 2011, 12:00 AM
URL | BibTeX
Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders.
Angelo Montanari, Ian Pratt-Hartmann, and Pietro Sala TIME, page 27-34. IEEE Computer Society, (2010)
to dblp by dblp on May 3, 2011, 12:00 AM
URL | BibTeX
Conditionalization and total knowledge.
Ian Pratt-Hartmann Journal of Applied Non-Classical Logics 18(2-3):247-266 (2008)
to dblp by dblp on Nov 25, 2010, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper