On the public citation graph

The complexity class θp2: Recent results and applications in AI and modal logic

0 signed · 67 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19980440108openalex-snapshot

Capturing Relativized Complexity Classes without Order

inferredcites →https://doi.org/10.1006/inco.1995.1098openalex-snapshot

Equivalence of NC and AC − 1 Closures of NP and Other Classes

inferredcites →https://doi.org/10.1006/inco.1995.1124openalex-snapshot

The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics

inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot

Finite Model Theory

inferredcites →https://doi.org/10.1007/3-540-55210-3_192openalex-snapshot

Characterizations of some complexity classes between Θ2p and Δ2p

inferredcites →https://doi.org/10.1007/3-540-57785-8_151openalex-snapshot

NCk(NP)=AC k−1(NP)

inferredcites →https://doi.org/10.1007/3-540-60246-1_113openalex-snapshot

Second order logic and the weak exponential hierarchies

inferredcites →https://doi.org/10.1007/3-540-62222-5_51openalex-snapshot

The complexity of iterated belief revision

inferredcites →https://doi.org/10.1007/3-540-63255-7_22openalex-snapshot

Modular logic programming and generalized quantifiers

inferredcites →https://doi.org/10.1007/978-3-662-03182-7_7openalex-snapshot

Descriptive Complexity Theory

inferredcites →https://doi.org/10.1007/bf01071084openalex-snapshot

Range and degree of realizability of formulas in the restricted predicate calculus

inferredcites →https://doi.org/10.1007/bf01683260openalex-snapshot

Relativization of questions about log space computability

inferredcites →https://doi.org/10.1007/bf01692056openalex-snapshot

RelativizedNC

inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot

Classical negation in logic programs and disjunctive databases

inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot

Two remarks on the power of counting

inferredcites →https://doi.org/10.1007/bfb0029617openalex-snapshot

On checking versus evaluation of multiple queries

inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot

Two remarks on the power of counting

inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot

A logic for default reasoning

inferredcites →https://doi.org/10.1016/0004-3702(92)90018-sopenalex-snapshot

On the complexity of propositional knowledge base revision, updates, and counterfactuals

inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot

The complexity of optimization problems

inferredcites →https://doi.org/10.1016/0022-0000(89)90024-xopenalex-snapshot

PNP[(log )] and sparse turing-complete sets for NP

inferredcites →https://doi.org/10.1016/0168-0072(86)90040-0openalex-snapshot

Henkin quantifiers and complete problems

inferredcites →https://doi.org/10.1016/0168-0072(94)90084-1openalex-snapshot

Zero-one laws for modal logic

inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot

More complicated questions about maxima and minima, and some closures of NP

inferredcites →https://doi.org/10.1016/0304-3975(91)90160-4openalex-snapshot

Bounded queries to SAT and the Boolean hierarchy

inferredcites →https://doi.org/10.1016/0304-3975(94)00080-3openalex-snapshot

Computing functions with parallel queries to NP

inferredcites →https://doi.org/10.1016/0304-3975(95)00192-1openalex-snapshot

Querying disjunctive databases through nonmonotonic logics

inferredcites →https://doi.org/10.1016/0890-5401(91)90075-dopenalex-snapshot

On truth-table reducibility to SAT

inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot

A Catalog of Complexity Classes

inferredcites →https://doi.org/10.1016/s0304-3975(96)00179-xopenalex-snapshot

Abduction from logic programs: Semantics and complexity

inferredcites →https://doi.org/10.1017/s0022481200051756openalex-snapshot

Probabilities on finite models

inferredcites →https://doi.org/10.1090/dimacs/031openalex-snapshot

Descriptive Complexity and Finite Models

inferredcites →https://doi.org/10.1093/logcom/2.3.397openalex-snapshot

Complexity Results for Nonmonotonic Logics

inferredcites →https://doi.org/10.1109/lics.1995.523245openalex-snapshot

Relativized logspace and generalized quantifiers over finite structures

inferredcites →https://doi.org/10.1109/sct.1990.113961openalex-snapshot

Width-bounded reducibility and binary search over complexity classes

inferredcites →https://doi.org/10.1137/0213028openalex-snapshot

Constant Depth Reducibility

inferredcites →https://doi.org/10.1137/0217078openalex-snapshot

The Boolean Hierarchy I: Structural Properties

inferredcites →https://doi.org/10.1137/0219058openalex-snapshot

Bounded Query Classes

inferredcites →https://doi.org/10.1145/200836.200838openalex-snapshot

The complexity of logic-based abduction

inferredcites →https://doi.org/10.1145/201019.201031openalex-snapshot

NP trees and Carnap's modal logic

inferredcites →https://doi.org/10.2307/2275546openalex-snapshot

Relativized logspace and generalized quantifiers over finite ordered structures

inferredcites →https://doi.org/10.3233/fi-1993-18105openalex-snapshot

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines

inferredcites →https://doi.org/10.3233/fi-1993-18106openalex-snapshot

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machine

inferredcites →https://doi.org/10.3233/fi-1994-21124openalex-snapshot

STATIONARY DEFAULT EXTENSIONS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-28520-2_5openalex-snapshot

Hierarchies Based on NP

inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot

Other Public-Key Cryptosystems and Protocols

inferred← citeshttps://doi.org/10.1007/978-3-030-34974-5_3openalex-snapshot

Justifiable Exceptions in General Contextual Hierarchies

inferred← citeshttps://doi.org/10.1007/978-3-319-49493-7_5openalex-snapshot

Inconsistency-Tolerant Querying of Description Logic Knowledge Bases

inferred← citeshttps://doi.org/10.1007/978-3-319-65340-2_58openalex-snapshot

Reactive Maintenance Policies over Equalized States in Dynamic Environments

inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_21openalex-snapshot

General Default Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_27openalex-snapshot

The Complexity of Computing Minimal Unidirectional Covering Sets

inferred← citeshttps://doi.org/10.1007/s00224-012-9437-9openalex-snapshot

The Complexity of Computing Minimal Unidirectional Covering Sets

inferred← citeshttps://doi.org/10.1007/s10472-009-9161-6openalex-snapshot

General default logic

inferred← citeshttps://doi.org/10.1016/j.artint.2009.09.001openalex-snapshot

The computational complexity of ideal semantics

inferred← citeshttps://doi.org/10.1016/j.artint.2011.04.001openalex-snapshot

Solving conflicts in information merging by a flexible interpretation of atomic propositions

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.031openalex-snapshot

The complexity of Kemeny elections

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.023openalex-snapshot

A novel characterization of the complexity class ΘkP based on counting and comparison

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00147-5openalex-snapshot

On the complexity of data disjunctions

inferred← citeshttps://doi.org/10.1017/s1471068423000364openalex-snapshot

Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings

inferred← citeshttps://doi.org/10.1051/ita:2005041openalex-snapshot

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

inferred← citeshttps://doi.org/10.1145/2749463openalex-snapshot

On the Complexity of Probabilistic Abstract Argumentation Frameworks

inferred← citeshttps://doi.org/10.1145/3583071openalex-snapshot

Mixed Iterated Revisions: Rationale, Algorithms, and Complexity

inferred← citeshttps://doi.org/10.1145/3655024openalex-snapshot

Strong Backdoors for Default Logic

inferred← citeshttps://doi.org/10.24963/ijcai.2019/236openalex-snapshot

Best Answers over Incomplete Data : Complexity and First-Order Rewritings

inferred← citeshttps://doi.org/10.24963/ijcai.2020/245openalex-snapshot

On Computational Aspects of Iterated Belief Change

inferred← citeshttps://doi.org/10.3233/aac-210018openalex-snapshot

Revisiting initial sets in abstract argumentation

inferred← citeshttps://doi.org/10.48550/arxiv.1808.01874openalex-snapshot

Reasoning with Justifiable Exceptions in Contextual Hierarchies (Appendix)

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.