:: Library Catalog

Bearbmagovva

Furkejuvvon:

Bibliográfalaš dieđut
Váldodahkki:	Pratt-Hartmann, Ian
Materiálatiipa:	Preprint
Almmustuhtton:	2007
Fáttát:	Logic in Computer Science Artificial Intelligence Computational Complexity F.4.1
Liŋkkat:	https://arxiv.org/abs/cs/0701039
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!

Geahča maid

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Dahkki: Pratt-Hartmann, Ian
Almmustuhtton: (2008)

Logics for the Relational Syllogistic
Dahkki: Pratt-Hartmann, Ian, et al.
Almmustuhtton: (2008)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Dahkki: Kazakov, Yevgeny, et al.
Almmustuhtton: (2009)

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
Dahkki: Pratt-Hartmann, Ian
Almmustuhtton: (2004)

The Hamiltonian Syllogistic
Dahkki: Pratt-Hartmann, Ian
Almmustuhtton: (2010)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
Dahkki: Ito, Sohei, et al.
Almmustuhtton: (2026)

The Fluted Fragment with Transitive Relations
Dahkki: Pratt-Hartmann, Ian, et al.
Almmustuhtton: (2020)

Complexity of Nonassociative Lambek Calculus with classical logic
Dahkki: Płaczek, Paweł
Almmustuhtton: (2024)

New Bounds for the Ideal Proof System in Positive Characteristic
Dahkki: Behera, Amik Raj, et al.
Almmustuhtton: (2025)

The Syllogistic with Unity
Dahkki: Pratt-Hartmann, Ian
Almmustuhtton: (2011)

Hypersequent Calculi Have Ackermannian Complexity
Dahkki: Balasubramanian, A. R., et al.
Almmustuhtton: (2026)

A Theory for Probabilistic Polynomial-Time Reasoning
Dahkki: Chen, Lijie, et al.
Almmustuhtton: (2026)

Structure-Guided Automated Reasoning
Dahkki: Bannach, Max, et al.
Almmustuhtton: (2023)

What If Turing Had Preceded Gödel?
Dahkki: Oberhoff, Sebastian
Almmustuhtton: (2024)

Set Theory in the Foundation of Math; Internal Classes and External Sets
Dahkki: Levin, Leonid A.
Almmustuhtton: (2022)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Dahkki: Pratt-Hartmann, Ian
Almmustuhtton: (2006)

Deducibility in the full Lambek calculus with weakening is HAck-complete
Dahkki: Greati, Vitor, et al.
Almmustuhtton: (2024)

Polynomial-time Tractable Problems over the $p$-adic Numbers
Dahkki: Fehm, Arno, et al.
Almmustuhtton: (2025)

On the Satisfaction Probabilities of $k$-CNF Formulas
Dahkki: Tantau, Till
Almmustuhtton: (2022)

On the existence of strong proof complexity generators
Dahkki: Krajicek, Jan
Almmustuhtton: (2022)

Towards Automated Readable Proofs of Ruler and Compass Constructions
Dahkki: Marinković, Vesna, et al.
Almmustuhtton: (2024)

The Guarded Fragment with Nested Equivalences
Dahkki: Fiuk, Oskar
Almmustuhtton: (2026)

Cardinality and Representation of Stone Relation Algebras
Dahkki: Furusawa, Hitoshi, et al.
Almmustuhtton: (2023)

Computation as a Game
Dahkki: Bilokon, Paul Alexander
Almmustuhtton: (2025)

Complexity Classification Transfer for CSPs via Algebraic Products
Dahkki: Bodirsky, Manuel, et al.
Almmustuhtton: (2022)

Two-Level Type Theory and Applications
Dahkki: Annenkov, Danil, et al.
Almmustuhtton: (2017)

SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic
Dahkki: Hansen, Zachary, et al.
Almmustuhtton: (2025)

Complexity of Łukasiewicz Modal Probabilistic Logics
Dahkki: Kozhemiachenko, Daniil, et al.
Almmustuhtton: (2025)

Notes on CSPs and Polymorphisms
Dahkki: Brady, Zarathustra
Almmustuhtton: (2022)

On Some Complexity Results for Even Linear Languages
Dahkki: Cojocaru, Liliana
Almmustuhtton: (2024)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
Dahkki: Backhouse, Roland, et al.
Almmustuhtton: (2023)

Incomplete Descriptions and Qualified Definiteness
Dahkki: Więckowski, Bartosz
Almmustuhtton: (2024)

Goal-Driven Query Answering over First- and Second-Order Dependencies with Equality
Dahkki: Tsamoura, Efthymia, et al.
Almmustuhtton: (2024)

Unique Characterisability and Learnability of Temporal Queries Mediated by an Ontology
Dahkki: Jung, Jean Christoph, et al.
Almmustuhtton: (2023)

The Thins Ordering on Relations
Dahkki: Voermans, Ed, et al.
Almmustuhtton: (2024)

Diagonals and Block-Ordered Relations
Dahkki: Backhouse, Roland, et al.
Almmustuhtton: (2024)

Plausible Reasoning and First-Order Plausible Logic
Dahkki: Billington, David
Almmustuhtton: (2026)

Experiments with Choice in Dependently-Typed Higher-Order Logic
Dahkki: Ranalter, Daniel, et al.
Almmustuhtton: (2024)

Deontic Temporal Logic for Formal Verification of AI Ethics
Dahkki: V., Priya T., et al.
Almmustuhtton: (2025)

T-CPDL: A Temporal Causal Probabilistic Description Logic for Developing Logic-RAG Agent
Dahkki: Yu, Hong Qing
Almmustuhtton: (2025)