UB Paderborn / Katalog / Suche / in CDI

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, p.1-10

Pratt-Hartmann, Ian

2014

Link zum Volltext

Verfügbarkeit prüfen

Equivalence closure in the two-variable guarded fragment

Journal of logic and computation, 2017-06, p.exv075

2017

Link zum Volltext

Verfügbarkeit prüfen

Two-Variable First-Order Logic with Equivalence Closure

2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012, p.431-440

2012

Link zum Volltext
IEEE_Xplore

The Syllogistic with Unity

Journal of philosophical logic, 2013-04, Vol.42 (2), p.391-407

Pratt-Hartmann, Ian

2013

Link zum Volltext

Verfügbarkeit prüfen

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

2009 24th Annual IEEE Symposium on Logic In Computer Science, 2009, p.407-416

2009

Link zum Volltext
IEEE_Xplore

Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey

Logic and Its Applications, 2019, Vol.11600, p.103-107

2019

Link zum Volltext

Verfügbarkeit prüfen

Two-Variable First-Order Logic with Equivalence Closure

SIAM journal on computing, 2014-01, Vol.43 (3), p.1012-1063

2014

Link zum Volltext

Verfügbarkeit prüfen

The Hamiltonian Syllogistic

Journal of logic, language, and information, 2011-10, Vol.20 (4), p.445-474

Pratt-Hartmann, Ian

2011

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable

Handbook of Spatial Logics

The two-variable fragment with counting and equivalence

Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting

LOGICS FOR THE RELATIONAL SYLLOGISTIC

On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

Fragments of First-Order Logic

THE FLUTED FRAGMENT REVISITED

Temporal prepositions and their logic

Spatial logics with connectedness predicates

The fluted fragment with transitive relations

Complexity of the Guarded Two-variable Fragment with Counting Quantifiers

Spatial reasoning with RCC 8 and connectedness constraints in Euclidean spaces

Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces

Complexity of the Two-Variable Fragment with Counting Quantifiers

Functions definable by numerical set-expressions

Spatial reasoning with and connectedness constraints in Euclidean spaces

Logics with counting and equivalence

Equivalence closure in the two-variable guarded fragment

Two-Variable First-Order Logic with Equivalence Closure

The Syllogistic with Unity

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey

Two-Variable First-Order Logic with Equivalence Closure

The Hamiltonian Syllogistic

Suchergebnisse filtern