Pages that link to "Item:Q2567347"
From MaRDI portal
The following pages link to Complexity of the two-variable fragment with counting quantifiers (Q2567347):
Displaying 30 items.
- A double team semantics for generalized quantifiers (Q302243) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- 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)
- A system of relational syllogistic incorporating full Boolean reasoning (Q2255203) (← links)
- Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- The two‐variable fragment with counting and equivalence (Q3460527) (← links)
- Cheap Boolean Role Constructors for Description Logics (Q3532479) (← links)
- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- Complexity Results for First-Order Two-Variable Logic with Counting (Q4943858) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
- On the Decidability of Elementary Modal Logics (Q5277903) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294) (← links)
- Completing the Picture: Complexity of Graded Modal Logics with Converse (Q6063859) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- Hybrid modal operators for definite descriptions (Q6545576) (← links)
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates (Q6566618) (← links)
- Two variable logic with ultimately periodic counting (Q6573777) (← links)
- On two-variable guarded fragment logic with expressive local Presburger constraints (Q6597967) (← links)
- Modal syllogistic (Q6599618) (← links)
