On the public citation graph

Logics in AI

https://doi.org/10.1007/bfb0023417
0 signed · 37 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.1007/10703163_24openalex-snapshot
On the Complexity of H-Subsumption
inferred← citeshttps://doi.org/10.1007/11828563_7openalex-snapshot
On the Complexity of the Equational Theory of Relational Action Algebras
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_7openalex-snapshot
Default negated conclusions: Why not?
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_33openalex-snapshot
Dynamic Epistemic Logic as a Substructural Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_11openalex-snapshot
Lattice–Based Relation Algebras and Their Representability
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_9openalex-snapshot
Relational Models of Lambek Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_11openalex-snapshot
The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_13openalex-snapshot
On Programs with Linearly Ordered Multiple Preferences
inferred← citeshttps://doi.org/10.1007/978-3-540-30207-0_81openalex-snapshot
Agent-Based Resource Selection for Grid Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_7openalex-snapshot
Hierarchical Decision Making by Autonomous Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-73445-1_19openalex-snapshot
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_2openalex-snapshot
Algebraic Valuations as Behavioral Logical Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-02377-4_1openalex-snapshot
Issues in Designing Logical Models for Norm Change
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_7openalex-snapshot
Composing Partially Ordered Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_37openalex-snapshot
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_1openalex-snapshot
Residuated Kleene Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_5openalex-snapshot
Automated Reasoning in Higher-Order Regular Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_10openalex-snapshot
Unifying Semantics for Concurrent Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-43742-1_3openalex-snapshot
An Interpretation of Full Lambek Calculus in Its Variant without Empty Antecedents of Sequents
inferred← citeshttps://doi.org/10.1007/978-94-011-3947-2_2openalex-snapshot
Anaphora from Athens to Amsterdam
inferred← citeshttps://doi.org/10.1007/978-94-015-8242-1_6openalex-snapshot
Cautious Backtracking in Truth Maintenance Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-8875-1_13openalex-snapshot
Relations between Sets of Time Points and Quasi-Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-94-017-3598-8_12openalex-snapshot
Type Logics in Grammar
inferred← citeshttps://doi.org/10.1007/bf00159342openalex-snapshot
Extending Lambek grammars to basic categorial grammars
inferred← citeshttps://doi.org/10.1007/bf01052600openalex-snapshot
Dynamic squares
inferred← citeshttps://doi.org/10.1007/bfb0021969openalex-snapshot
Revision of non-monotonic theories
inferred← citeshttps://doi.org/10.1007/bfb0023425openalex-snapshot
Relevance and revision
inferred← citeshttps://doi.org/10.1007/bfb0028209openalex-snapshot
A default logic based on epistemic states
inferred← citeshttps://doi.org/10.1007/bfb0028224openalex-snapshot
Belief revision by expansion
inferred← citeshttps://doi.org/10.1007/bfb0031845openalex-snapshot
AgentSpeak(L): BDI agents speak out in a logical computable language
inferred← citeshttps://doi.org/10.1007/s10992-011-9171-9openalex-snapshot
AGM 25 Years
inferred← citeshttps://doi.org/10.1007/s11225-006-9004-yopenalex-snapshot
Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50015-1openalex-snapshot
Partiality
inferred← citeshttps://doi.org/10.1093/logcom/exu040openalex-snapshot
Dynamic consequence for soft information
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1994.tb00168.xopenalex-snapshot
DEFAULT LOGICS: A UNIFIED VIEW
inferred← citeshttps://doi.org/10.3115/976744.976778openalex-snapshot
Tuples, discontinuity, and gapping in categorial grammar
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.