Pages that link to "Item:Q4943858"

The following pages link to Complexity Results for First-Order Two-Variable Logic with Counting (Q4943858):

Displaying 27 items.

• A description logic based situation calculus (Q604908) (← links)
• Deciding expressive description logics in the framework of resolution (Q924723) (← links)
• A resolution-based decision procedure for \({\mathcal{SHOIQ}}\). (Q928657) (← links)
• The guarded fragment with transitive guards (Q1877098) (← links)
• Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691) (← links)
• One-variable logic meets Presburger arithmetic (Q2007734) (← links)
• Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
• A family of dynamic description logics for representing and reasoning about actions (Q2392414) (← links)
• A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
• The complexity of finite model reasoning in description logics (Q2486582) (← links)
• Complexity of the two-variable fragment with counting quantifiers (Q2567347) (← links)
• Number of variables is equivalent to space (Q2758055) (← links)
• Enumeration complexity of logical query problems with second-order variables (Q2915682) (← links)
• Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) (← links)
• The two‐variable fragment with counting and equivalence (Q3460527) (← links)
• CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
• (Q4202936) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• Two-Variable Logic over Countable Linear Orderings (Q4608629) (← links)
• Logics with counting and equivalence (Q4635661) (← links)
• Counting Objects (Q4835536) (← links)
• Weighted model counting beyond two-variable logic (Q5145338) (← links)
• Circuit complexity and the expressive power of generalized first-order formulas (Q5204302) (← links)
• Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294) (← links)
• Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy (Q5865564) (← links)
• Two variable logic with ultimately periodic counting (Q6573777) (← links)