en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Pratt-Hartmann
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(47)
tags
dblp
ambiguity
logic
time
answer_extraction
No matching items.
Total Knowledge.
Ian Pratt-Hartmann
.
AAAI/IAAI,
page 423-428.
AAAI Press / The MIT Press,
(
2000
)
Ian Pratt-Hartmann
.
AAAI/IAAI,
page 423-428.
AAAI Press / The MIT Press,
(
2000
)
5 months and 12 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Topological Constraint Language with Component Counting.
Ian Pratt-Hartmann
.
Journal of Applied Non-Classical Logics
12(3-4):441-468
(
2002
)
Ian Pratt-Hartmann
.
Journal of Applied Non-Classical Logics
12(3-4):441-468
(
2002
)
7 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Conditionalization and total knowledge.
Ian Pratt-Hartmann
.
Journal of Applied Non-Classical Logics
18(2-3):247-266
(
2008
)
Ian Pratt-Hartmann
.
Journal of Applied Non-Classical Logics
18(2-3):247-266
(
2008
)
7 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann
.
CoRR
(
2006
)
Ian Pratt-Hartmann
.
CoRR
(
2006
)
7 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Editors' Preface.
Nissim Francez
, and
Ian Pratt-Hartmann
.
Studia Logica
100(4):663-665
(
2012
)
Nissim Francez
, and
Ian Pratt-Hartmann
.
Studia Logica
100(4):663-665
(
2012
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Two-Variable First-Order Logic with Equivalence Closure.
Emanuel Kieronski
,
Jakub Michaliszyn
,
Ian Pratt-Hartmann
, and
Lidia Tendera
.
LICS,
page 431-440.
IEEE,
(
2012
)
Emanuel Kieronski
,
Jakub Michaliszyn
,
Ian Pratt-Hartmann
, and
Lidia Tendera
.
LICS,
page 431-440.
IEEE,
(
2012
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Elementary Polyhedral Mereotopology.
Ian Pratt-Hartmann
, and
Dominik J. Schoop
.
J. Philosophical Logic
31(5):469-498
(
2002
)
Ian Pratt-Hartmann
, and
Dominik J. Schoop
.
J. Philosophical Logic
31(5):469-498
(
2002
)
a year ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
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
)
Yevgeny Kazakov
, and
Ian Pratt-Hartmann
.
LICS,
page 407-416.
IEEE Computer Society,
(
2009
)
a year and 4 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
Roman Kontchakov
,
Yavor Nenov
,
Ian Pratt-Hartmann
, and
Michael Zakharyaschev
.
CoRR
(
2011
)
Roman Kontchakov
,
Yavor Nenov
,
Ian Pratt-Hartmann
, and
Michael Zakharyaschev
.
CoRR
(
2011
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Complex Algebras of Arithmetic
Ivo Düntsch
, and
Ian Pratt-Hartmann
.
CoRR
(
2009
)
Ivo Düntsch
, and
Ian Pratt-Hartmann
.
CoRR
(
2009
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Functions Definable by Numerical Set-Expressions
Ian Pratt-Hartmann
, and
Ivo Düntsch
.
CoRR
(
2009
)
Ian Pratt-Hartmann
, and
Ivo Düntsch
.
CoRR
(
2009
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Logics for the Relational Syllogistic
Ian Pratt-Hartmann
, and
Lawrence S. Moss
.
CoRR
(
2008
)
Ian Pratt-Hartmann
, and
Lawrence S. Moss
.
CoRR
(
2008
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Complexity of the Two-Variable Fragment with Binary-Coded Counting Quantifiers
Ian Pratt-Hartmann
.
CoRR
(
2004
)
Ian Pratt-Hartmann
.
CoRR
(
2004
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Ian Pratt-Hartmann
.
CoRR
(
2007
)
Ian Pratt-Hartmann
.
CoRR
(
2007
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Topological Logics with Connectedness over Euclidean Spaces
Roman Kontchakov
,
Yavor Nenov
,
Ian Pratt-Hartmann
, and
Michael Zakharyaschev
.
CoRR
(
2011
)
Roman Kontchakov
,
Yavor Nenov
,
Ian Pratt-Hartmann
, and
Michael Zakharyaschev
.
CoRR
(
2011
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Syllogistic with Unity
Ian Pratt-Hartmann
.
CoRR
(
2011
)
Ian Pratt-Hartmann
.
CoRR
(
2011
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Yevgeny Kazakov
, and
Ian Pratt-Hartmann
.
CoRR
(
2009
)
Yevgeny Kazakov
, and
Ian Pratt-Hartmann
.
CoRR
(
2009
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
The Hamiltonian Syllogistic
Ian Pratt-Hartmann
.
CoRR
(
2010
)
Ian Pratt-Hartmann
.
CoRR
(
2010
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann
.
CoRR
(
2008
)
Ian Pratt-Hartmann
.
CoRR
(
2008
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Hamiltonian Syllogistic.
Ian Pratt-Hartmann
.
Journal of Logic, Language and Information
20(4):445-474
(
2011
)
Ian Pratt-Hartmann
.
Journal of Logic, Language and Information
20(4):445-474
(
2011
)
a year and 8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact