Pages that link to "Item:Q989577"
From MaRDI portal
The following pages link to The complexity of propositional implication (Q989577):
Displaying 16 items.
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- A note on the computational complexity of the pure classical implication calculus (Q1263982) (← links)
- The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← links)
- Lewis dichotomies in many-valued logics (Q1935553) (← links)
- An unexpected Boolean connective (Q2169126) (← links)
- Isomorphic implication (Q2272203) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- The Complexity of Reasoning for Fragments of Default Logic (Q3637157) (← links)
- (Q4729773) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928) (← links)
- The Weight in Enumeration (Q5738998) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)