On the public citation graph

Logical Description of Monotone NP Problems

0 signed · 27 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19970430203openalex-snapshot
Logics with Zero‐One Laws that Are Not Fragments of Bounded‐Variable Infinitary Logic
inferred← citeshttps://doi.org/10.1006/inco.1997.2696openalex-snapshot
Succinct Representation, Leaf Languages, and Projection Reductions
inferred← citeshttps://doi.org/10.1006/inco.1998.2742openalex-snapshot
Positive Versions of Polynomial Time
inferred← citeshttps://doi.org/10.1007/11682462_14openalex-snapshot
Counting Proportions of Sets: Expressive Power with Almost Order
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_3openalex-snapshot
A Perspective on Lindström Quantifiers and Oracles
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_4openalex-snapshot
Generalized Quantifiers in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_57openalex-snapshot
Approximating the Expressive Power of Logics in Finite Models
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_7openalex-snapshot
The Role of Monotonicity in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.1007/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferred← citeshttps://doi.org/10.1007/bfb0049340openalex-snapshot
Incorporating generalized quantifiers and the least fixed point operator
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90036-1openalex-snapshot
Context-sensitive transitive closure operators
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00175-iopenalex-snapshot
Complete problems for monotone NP
inferred← citeshttps://doi.org/10.1016/j.artint.2014.04.004openalex-snapshot
The price of query rewriting in ontology-based data access
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.09.002openalex-snapshot
Graph properties checkable in linear time in the number of vertices
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00183-9openalex-snapshot
Program schemes, arrays, Lindström quantifiers and zero-one laws
inferred← citeshttps://doi.org/10.1093/jigpal/jzn031openalex-snapshot
Approximate formulae for a logic that capture classes of computational complexity
inferred← citeshttps://doi.org/10.1093/logcom/9.6.915openalex-snapshot
Hierarchies in classes of program schemes
inferred← citeshttps://doi.org/10.1093/logcom/exl011openalex-snapshot
Expressive Power and Complexity of a Logic with Quantifiers that Count Proportions of Sets
inferred← citeshttps://doi.org/10.1109/ccc.1996.507675openalex-snapshot
Succinct representation, leaf languages, and projection reductions
inferred← citeshttps://doi.org/10.1109/ccc.1996.507678openalex-snapshot
On positive P
inferred← citeshttps://doi.org/10.1109/ccc.1998.694598openalex-snapshot
How to encode a logical structure by an OBDD
inferred← citeshttps://doi.org/10.1109/icmt.2011.6001802openalex-snapshot
On cognitive application of generalized computer Logic
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470602openalex-snapshot
Positive First-order Logic on Words
inferred← citeshttps://doi.org/10.1112/s1461157000000371openalex-snapshot
Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
inferred← citeshttps://doi.org/10.3233/fi-2009-0050openalex-snapshot
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2023.29openalex-snapshot
Constant-Depth Circuits vs. Monotone Circuits
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:7)2023openalex-snapshot
Positive First-order Logic on Words and Graphs
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.