Complexity thresholds in inclusion logic

DOI10.1007/978-3-662-59533-6_19zbMath1496.03131arXiv1903.10706OpenAlexW3196404662MaRDI QIDQ5919492

Lauri Hella, Miika Hannula

Publication date: 4 March 2020

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.10706

zbMATH Keywords

complexityteam semanticsconsistent query answeringinclusion logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in computer science (03B70)

Related Items (3)

Propositional union closed team logics ⋮ Axiomatizing first order consequences in inclusion logic ⋮ Complexity thresholds in inclusion logic

This page was built for publication: Complexity thresholds in inclusion logic