Ian Pratt-Hartmann

According to our database1, Ian Pratt-Hartmann authored at least 65 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The Fluted Fragment Revisited.
J. Symb. Log., 2019

The Fluted Fragment with Transitivity.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey.
Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

2018
Two-variable logics with counting and semantic constraints.
SIGLOG News, 2018

Finite satisfiability for two-variable, first-order logic with one transitive relation is decidable.
Math. Log. Q., 2018

Quine's Fluted Fragment Revisited.
CoRR, 2018

Two-variable First-Order Logic with Counting in Forests.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

2017
Equivalence closure in the two-variable guarded fragment.
J. Log. Comput., 2017

Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting.
Logical Methods in Computer Science, 2017

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable.
CoRR, 2017

2016
Quine's Fluted Fragment is Non-Elementary.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
The two-variable fragment with counting and equivalence.
Math. Log. Q., 2015

2014
Two-Variable First-Order Logic with Equivalence Closure.
SIAM J. Comput., 2014

Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces.
Artif. Intell., 2014

Logics with counting and equivalence.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Topological Logics with Connectedness over Euclidean Spaces.
ACM Trans. Comput. Log., 2013

Functions definable by numerical set-expressions.
J. Log. Comput., 2013

The Syllogistic with Unity.
J. Philosophical Logic, 2013

2012
Editors' Preface.
Studia Logica, 2012

Report on BCTCS 2012.
Bulletin of the EATCS, 2012

2011
The Hamiltonian Syllogistic.
Journal of Logic, Language and Information, 2011

On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces.
Proceedings of the IJCAI 2011, 2011

2010
Spatial logics with connectedness predicates
Logical Methods in Computer Science, 2010

The Two-Variable Fragment with Counting Revisited.
Proceedings of the Logic, 2010

Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders.
Proceedings of the TIME 2010, 2010

Interpreting Topological Logics over Euclidean Spaces.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

On the Computability of Region-Based Euclidean Logics.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Logics for the Relational Syllogistic.
Rev. Symb. Log., 2009

Data-complexity of the two-variable fragment with counting quantifiers.
Inf. Comput., 2009

Complex Algebras of Arithmetic.
Fundam. Inform., 2009

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Computational Complexity of Controlled Natural Languages.
Proceedings of the Pre-Proceedings of the Workshop on Controlled Natural Language (CNL 2009), 2009

Functions Definable by Arithmetic Circuits.
Proceedings of the Mathematical Theory and Computational Practice, 2009

No Syllogisms for the Numerical Syllogistic.
Proceedings of the Languages: From Formal to Natural, 2009

2008
Conditionalization and total knowledge.
Journal of Applied Non-Classical Logics, 2008

On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics.
Bulletin of Symbolic Logic, 2008

On the Computational Complexity of Spatial Logics with Connectedness Constraints.
Proceedings of the Logic for Programming, 2008

Topology, connectedness, and modal logic.
Proceedings of the Advances in Modal Logic 7, 2008

2007
First-Order Mereotopology.
Proceedings of the Handbook of Spatial Logics, 2007

What is Spatial Logic?
Proceedings of the Handbook of Spatial Logics, 2007

Complexity of the Guarded Two-variable Fragment with Counting Quantifiers.
J. Log. Comput., 2007

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
CoRR, 2007

2006
More Fragments of Language.
Notre Dame Journal of Formal Logic, 2006

2005
Complexity of the Two-Variable Fragment with Counting Quantifiers.
Journal of Logic, Language and Information, 2005

Temporal prepositions and their logic.
Artif. Intell., 2005

From TimeML to TPL.
Proceedings of the Annotating, 2005

2004
Fragments of Language.
Journal of Logic, Language and Information, 2004

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
CoRR, 2004

2003
A Two-Variable Fragment of English.
Journal of Logic, Language and Information, 2003

2002
Elementary Polyhedral Mereotopology.
J. Philosophical Logic, 2002

A Topological Constraint Language with Component Counting.
Journal of Applied Non-Classical Logics, 2002

2001
Empiricism and Rationalism in Region-based Theories of Space.
Fundam. Inform., 2001

A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Expressivity in Polygonal, Plane Mereotopology.
J. Symb. Log., 2000

Total Knowledge.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
First-order qualitative spatial representation languages with convexity.
Spatial Cognition & Computation, 1999

Shape Representation Using Fourier Coefficients of the Sinusoidal Transform.
Journal of Mathematical Imaging and Vision, 1999

Logics for geographic information.
Journal of Geographical Systems, 1999

1998
Complete Logics for QSR: A Guide to Plane Meretopology.
J. Vis. Lang. Comput., 1998

On the Insufficiency of Linear Diagrams for Syllogisms.
Notre Dame Journal of Formal Logic, 1998

A Complete Axiom System for Polygonal Mereotopology of the Real Plane.
J. Philosophical Logic, 1998

1997
Ontologies for Plane, Polygonal Mereotopology.
Notre Dame Journal of Formal Logic, 1997

1996
On the Incompleteness of Modal Logics of Space: Advancing Complete Modal Logics of Place.
Proceedings of the Advances in Modal Logic 1, 1996

1994
The Expressive Power of the English Temporal Preposition System.
Proceedings of the TIME-94 International Workshop on Temporal Reasoning, 1994

1993
Map Semantics.
Proceedings of the Spatial Information Theory: A Theoretical Basis for GIS, 1993


  Loading...