The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Henkin quantifiers and complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying disjunctive databases through nonmonotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preferred answer sets for extended logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of some complexity classes between Θ2p and Δ2p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capturing Relativized Complexity Classes without Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of propositional knowledge base revision, updates, and counterfactuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction from logic programs: Semantics and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities on finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP trees and Carnap's modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of default reasoning under the stationary fixed point semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order logic and the weak exponential hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one laws for modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing functions with parallel queries to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization of questions about log space computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5285980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More complicated questions about maxima and minima, and some closures of NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: RelativizedNC / rank
 
Normal rank

Latest revision as of 03:01, 31 July 2024

scientific article; zbMATH DE number 7631356
Language Label Description Also known as
English
The complexity class θp2: Recent results and applications in AI and modal logic
scientific article; zbMATH DE number 7631356

    Statements

    The complexity class θp2: Recent results and applications in AI and modal logic (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    modal logic
    0 references
    directed acyclic graph
    0 references
    logic programming
    0 references
    Kripke structure
    0 references
    default theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references