Complexity of the two-variable fragment with counting quantifiers
From MaRDI portal
Publication:2567347
DOI10.1007/s10849-005-5791-1zbMath1082.03007OpenAlexW1997817571MaRDI QIDQ2567347
Publication date: 4 October 2005
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-005-5791-1
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
On the Decidability of Elementary Modal Logics, Two-Variable Logic with Counting and Trees, A double team semantics for generalized quantifiers, The two‐variable fragment with counting and equivalence, Data-complexity of the two-variable fragment with counting quantifiers, Expressive probabilistic description logics, Combining answer set programming with description logics for the semantic web, A description logic based situation calculus, Modal Inclusion Logic: Being Lax is Simpler than Being Strict, Graphs Identified by Logics with Counting, Completing the Picture: Complexity of Graded Modal Logics with Converse, INTERLEAVING LOGIC AND COUNTING, Cheap Boolean Role Constructors for Description Logics, Deciding expressive description logics in the framework of resolution, A resolution-based decision procedure for \({\mathcal{SHOIQ}}\)., On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics, Complexity of two-variable dependence logic and IF-logic, Quantitative Logic Reasoning, A system of relational syllogistic incorporating full Boolean reasoning, Expressivity and Complexity of Dependence Logic, Combining Theories with Shared Set Operations, Regular Graphs and the Spectra of Two-Variable Logic with Counting
Cites Work
