NP trees and Carnap's modal logic
From MaRDI portal
Publication:4369870
DOI10.1145/201019.201031zbMath0886.68069OpenAlexW2110472925WikidataQ59259760 ScholiaQ59259760MaRDI QIDQ4369870
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/201019.201031
Related Items (16)
The complexity class θp2: Recent results and applications in AI and modal logic ⋮ A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison ⋮ Stability, vertex stability, and unfrozenness for special graph classes ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Unnamed Item ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Redundancy in logic. I: CNF propositional formulae ⋮ On the decidability and complexity of reasoning about only knowing ⋮ Epistemic GDL: a logic for representing and reasoning about imperfect information games ⋮ General default logic ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments ⋮ Circuits over PP and PL ⋮ A uniform tableaux method for nonmonotonic modal logics ⋮ Iterative and core-guided maxsat solving: a survey and assessment
This page was built for publication: NP trees and Carnap's modal logic
