On the public citation graph

Guarded Negation

0 signed · 75 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.19750210118openalex-snapshot

On languages with two variables

inferredcites →https://doi.org/10.1007/3-540-45653-8_5openalex-snapshot

Games and Model Checking for Guarded Logics

inferredcites →https://doi.org/10.1007/3-540-48660-7_3openalex-snapshot

Decision Procedures for Guarded Logics

inferredcites →https://doi.org/10.1007/978-3-642-22012-8_28openalex-snapshot

Guarded Negation

inferredcites →https://doi.org/10.1007/978-3-642-40313-2_11openalex-snapshot

Rewriting Guarded Negation Queries

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

Undecidability results on two-variable logics

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

Undecidability results on two-variable logics

inferredcites →https://doi.org/10.1016/j.apal.2004.04.003openalex-snapshot

Modal and guarded characterisation theorems over finite transition systems

inferredcites →https://doi.org/10.1016/j.apal.2013.06.017openalex-snapshot

Expressive completeness through logically tractable models

inferredcites →https://doi.org/10.1016/j.ipl.2012.02.005openalex-snapshot

Finite satisfiability for guarded fixpoint logic

inferredcites →https://doi.org/10.1016/s0304-3975(02)00866-6openalex-snapshot

The finite graph problem for two-way alternating automata

inferredcites →https://doi.org/10.1016/s0890-5401(03)00012-9openalex-snapshot

On the complexity of single-rule datalog queries

inferredcites →https://doi.org/10.1017/cbo9780511492358.008openalex-snapshot

Johan van Benthem

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

Model Theory

inferredcites →https://doi.org/10.1023/a:1004275029985openalex-snapshot

Modal Languages and Bounded Fragments of Predicate Logic

inferredcites →https://doi.org/10.1023/a:1011207512025openalex-snapshot

Tolerance Logic

inferredcites →https://doi.org/10.1023/a:1015178417181openalex-snapshot

Loosely Guarded Fragment of First-Order Logic has the Finite Model Property

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

Why is modal logic so robustly decidable?

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

Guarded fixed point logic

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

Querying the Guarded Fragment

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

Ontology-based data access

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

Query evaluation via tree-decompositions

inferredcites →https://doi.org/10.14778/2350229.2350250openalex-snapshot

Queries with guarded negation

inferredcites →https://doi.org/10.2168/lmcs-10(2:3)2014openalex-snapshot

Querying the Guarded Fragment

inferredcites →https://doi.org/10.2168/lmcs-9(3:25)2013openalex-snapshot

Unary negation

inferredcites →https://doi.org/10.2178/bsl/1182353853openalex-snapshot

Fixed Point Logics

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

On the Restraining Power of Guards

inferredcites →https://doi.org/10.48550/arxiv.1301.6479openalex-snapshot

Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-57977-7_10openalex-snapshot

Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies

inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_2openalex-snapshot

Guarded Ontology-Mediated Queries

inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_3openalex-snapshot

Semiring Provenance for Guarded Logics

inferred← citeshttps://doi.org/10.1007/978-3-031-19433-7_8openalex-snapshot

How to Agree to Disagree

inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_7openalex-snapshot

Craig Interpolation for Decidable First-Order Fragments

inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_9openalex-snapshot

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules

inferred← citeshttps://doi.org/10.1007/978-981-97-6429-7_1openalex-snapshot

Bidirectional Programming in BIRDS

inferred← citeshttps://doi.org/10.1007/s00224-018-9901-2openalex-snapshot

Evaluating Datalog via Tree Automata and Cycluits

inferred← citeshttps://doi.org/10.1007/s10817-023-09687-xopenalex-snapshot

Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments

inferred← citeshttps://doi.org/10.1007/s11225-018-9824-6openalex-snapshot

Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach)

inferred← citeshttps://doi.org/10.1007/s13218-020-00686-3openalex-snapshot

Ontologies and Data Management: A Brief Survey

inferred← citeshttps://doi.org/10.1007/s13748-021-00240-8openalex-snapshot

First-order logic as a constraint satisfaction problem

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

Logical separability of labeled data examples under ontologies

inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106113openalex-snapshot

Statistical EL is ExpTime-complete

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

Monodic fragments of probabilistic first-order temporal logic with bounded semantics

inferred← citeshttps://doi.org/10.1017/jsl.2018.64openalex-snapshot

SOME MODEL THEORY OF GUARDED NEGATION

inferred← citeshttps://doi.org/10.1017/jsl.2023.60openalex-snapshot

PROOF SYSTEMS FOR TWO-WAY MODAL μ-CALCULUS

inferred← citeshttps://doi.org/10.1093/logcom/exaf042openalex-snapshot

The adjacent fragment and Quine’s limits of decision

inferred← citeshttps://doi.org/10.1109/lics.2017.8005073openalex-snapshot

Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries

inferred← citeshttps://doi.org/10.1109/lics.2017.8005094openalex-snapshot

A fine-grained hierarchy of hard problems in the separated fragment

inferred← citeshttps://doi.org/10.1109/lics.2019.8785658openalex-snapshot

Model Comparison Games for Horn Description Logics

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470511openalex-snapshot

On Logics and Homomorphism Closure

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470585openalex-snapshot

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments

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

Automata column

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

Automata column

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

Guarded-Based Disjunctive Tuple-Generating Dependencies

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

Dichotomies in Ontology-Mediated Querying with the Guarded Fragment

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

A survey on guarded negation

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

Containment for Rule-Based Ontology-Mediated Queries

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

When Can We Answer Queries Using Result-Bounded Data Interfaces?

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

Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms

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

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?

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

Weighted model counting beyond two-variable logic

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

Unary negation fragment with equivalence relations has the finite model property

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

The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs

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

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

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

Inference from Visible Information and Background Knowledge

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

Determinacy of Real Conjunctive Queries. The Boolean Case

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

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

inferred← citeshttps://doi.org/10.14778/3377369.3377380openalex-snapshot

Programmable view update strategies on relations

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11565openalex-snapshot

Combining Rules and Ontologies into Clopen Knowledge Bases

inferred← citeshttps://doi.org/10.4204/eptcs.243.4openalex-snapshot

Finite Model Reasoning in Expressive Fragments of First-Order Logic

inferred← citeshttps://doi.org/10.4204/eptcs.390.1openalex-snapshot

A Uniform One-Dimensional Fragment with Alternation of Quantifiers

inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.16openalex-snapshot

One-Dimensional Guarded Fragments

inferred← citeshttps://doi.org/10.5555/3329995.3330008openalex-snapshot

Herbrand property, finite quasi-herbrand models, and a chandra-merlin theorem for quantified conjunctive queries

inferred← citeshttps://doi.org/10.5555/3329995.3330029openalex-snapshot

A fine-grained hierarchy of hard problems in the separated fragment

inferred← citeshttps://doi.org/10.70675/86b37144z3689z4cedzb5aez3b420a78f57dopenalex-snapshot

Combined complexity of probabilistic query evaluation

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.