The following pages link to NP trees and Carnap's modal logic (Q4369870):
Displaying 16 items.
- General default logic (Q987485) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives (Q1706170) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases (Q2970304) (← links)
- (Q5015270) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- A uniform tableaux method for nonmonotonic modal logics (Q5235255) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)