On the public citation graph

Nonmonotonic and Inductive Logic

0 signed · 18 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/1-4020-3092-4_3openalex-snapshot

How to Go Nonmonotonic

inferred← citeshttps://doi.org/10.1007/11776420_20openalex-snapshot

Memory-Limited U-Shaped Learning

inferred← citeshttps://doi.org/10.1007/11872436_25openalex-snapshot

Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses

inferred← citeshttps://doi.org/10.1007/3-540-58107-3_11openalex-snapshot

Weak autoepistemic reasoning and well-founded semantics

inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_8openalex-snapshot

Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-89378-3_51openalex-snapshot

Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering

inferred← citeshttps://doi.org/10.1007/978-3-642-14183-6_8openalex-snapshot

Moral Particularism and Deontic Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-14888-0_27openalex-snapshot

Learning from Positive Data Based on the MINL Strategy with Refinement Operators

inferred← citeshttps://doi.org/10.1007/bf00881832openalex-snapshot

A new methodology for query answering in default logics via structure-oriented theorem proving

inferred← citeshttps://doi.org/10.1007/bfb0031927openalex-snapshot

Semantics of nonmonotonic reasoning in logic programming

inferred← citeshttps://doi.org/10.1007/s10994-012-5301-zopenalex-snapshot

Learning figures with the Hausdorff metric by fractals—towards computable binary classification

inferred← citeshttps://doi.org/10.1007/s12546-010-9030-5openalex-snapshot

Semantic analysis of natural language processing in a study of nurse mobility in the Northern Territory, Australia

inferred← citeshttps://doi.org/10.1016/j.ic.2022.104913openalex-snapshot

Learnability and positive equivalence relations

inferred← citeshttps://doi.org/10.1016/j.jcss.2003.08.001openalex-snapshot

Trees and learning

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

Memory-limited non-U-shaped learning with solved open problems

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

A map of update constraints in inductive inference

inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot

Prolog technology for default reasoning: proof theory and compilation techniques

inferred← citeshttps://doi.org/10.1016/s1874-5857(07)80012-4openalex-snapshot

Nonmonotonic Reasoning

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.