On the public citation graph
On transitive closure logic
0 signed · 66 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-18170-9_158openalex-snapshot
Skolem normal forms concerning the least fixpoint
inferredcites →https://doi.org/10.1007/3-540-51498-8_23openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1007/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified logic programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferredcites →https://doi.org/10.1090/psapm/038/1020810openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1109/lics.1990.113742openalex-snapshot
0-1 laws for infinitary logics
inferredcites →https://doi.org/10.1109/sfcs.1989.63543openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1109/sfcs.1992.267775openalex-snapshot
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1145/113413.113415openalex-snapshot
On Datalog vs. polynomial time (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298542openalex-snapshot
On the expressive power of datalog
inferredcites →https://doi.org/10.1145/73007.73018openalex-snapshot
Expressiveness of restricted recursive queries
inferredcites →https://doi.org/10.1145/73721.73751openalex-snapshot
Inductive pebble games and the expressive power of datalog
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4893745openalex-extracted
Revisiting the Expressiveness Landscape of Data Graph Queries
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.1995.1147openalex-snapshot
Pebble Games and Subroutines in Least Fixed Point Logic
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_5openalex-snapshot
Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course
inferred← citeshttps://doi.org/10.1007/978-3-030-78163-7_18openalex-snapshot
A Logic-Based Approach to Incremental Reasoning on Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_30openalex-snapshot
Cyclic Proofs, Hypersequents, and Transitive Closure Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_13openalex-snapshot
Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
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/978-94-017-0253-9_7openalex-snapshot
Transitive Closure and the Mechanization of Mathematics
inferred← citeshttps://doi.org/10.1007/s001530050130openalex-snapshot
Undecidability results on two-variable logics
inferred← citeshttps://doi.org/10.1007/s00224-004-1147-5openalex-snapshot
Fixed-Point Logics and Solitaire Games
inferred← citeshttps://doi.org/10.1007/s10817-023-09675-1openalex-snapshot
Cyclic Hypersequent System for Transitive Closure Logic
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00021-6openalex-snapshot
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00113-1openalex-snapshot
Monadic partition logics and finite automata
inferred← citeshttps://doi.org/10.1016/j.artint.2015.06.008openalex-snapshot
A new probabilistic constraint logic programming language based on a generalised distribution semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.041openalex-snapshot
Classifying regular languages by a split game
inferred← citeshttps://doi.org/10.1017/s1471068414000076openalex-snapshot
Inference and learning in probabilistic logic programs using weighted Boolean formulas
inferred← citeshttps://doi.org/10.1023/a:1026107209351openalex-snapshot
Guarded Quantification in Least Fixed Point Logic
inferred← citeshttps://doi.org/10.1093/logcom/9.6.915openalex-snapshot
Hierarchies in classes of program schemes
inferred← citeshttps://doi.org/10.1109/lics.1992.185519openalex-snapshot
Deterministic vs. nondeterministic transitive closure logic
inferred← citeshttps://doi.org/10.1109/lics.1995.523268openalex-snapshot
Tree canonization and transitive closure
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267775openalex-snapshot
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366882openalex-snapshot
Logical reducibility and monadic NP
inferred← citeshttps://doi.org/10.1109/synasc.2015.68openalex-snapshot
Incremental Reasoning on Strongly Distributed Multi-agent Systems
inferred← citeshttps://doi.org/10.1109/tse.2025.3625772openalex-snapshot
Computation Tree Logic Guided Program Repair
inferred← citeshttps://doi.org/10.1145/1265530.1265542openalex-snapshot
Expressiveness and complexity of xml publishing transducers
inferred← citeshttps://doi.org/10.1145/1376916.1376952openalex-snapshot
XPath, transitive closure logic, and nested tree walking automata
inferred← citeshttps://doi.org/10.1145/1412331.1412337openalex-snapshot
Expressiveness and complexity of XML publishing transducers
inferred← citeshttps://doi.org/10.1145/1706591.1706598openalex-snapshot
Transitive closure logic, nested tree walking automata, and XPath
inferred← citeshttps://doi.org/10.1515/9783110324907.31openalex-snapshot
A New Approach to Predicative Set Theory
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:12)2012openalex-snapshot
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
inferred← citeshttps://doi.org/10.24963/ijcai.2019/256openalex-snapshot
Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics
inferred← citeshttps://doi.org/10.29007/45rvopenalex-snapshot
A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12990openalex-snapshot
Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics (Full Version)
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.