On the public citation graph

A decidable subclass of finitary programs

https://doi.org/10.1017/s1471068410000232

0 signed · 32 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.1007/3-540-45402-0_20openalex-snapshot

Omega-Restricted Logic Programs

inferredcites →https://doi.org/10.1007/3-540-45402-0_34openalex-snapshot

Prototypes for Reasoning with Infinite Stable Models and Function Symbols

inferredcites →https://doi.org/10.1007/3-540-47813-2_9openalex-snapshot

Combining Norms to Prove Termination

inferredcites →https://doi.org/10.1007/3-540-63255-7_27openalex-snapshot

A deductive system for non-monotonic reasoning

inferredcites →https://doi.org/10.1007/978-3-540-72200-7_24openalex-snapshot

GrinGo: A New Grounder for Answer Set Programming

inferredcites →https://doi.org/10.1007/978-3-540-75560-9_37openalex-snapshot

$\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

inferredcites →https://doi.org/10.1007/978-3-540-89982-2openalex-snapshot

Logic Programming

inferredcites →https://doi.org/10.1007/978-3-540-89982-2_25openalex-snapshot

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

inferredcites →https://doi.org/10.1007/978-3-540-89982-2_37openalex-snapshot

Computable Functions in ASP: Theory and Implementation

inferredcites →https://doi.org/10.1007/978-3-540-89982-2_38openalex-snapshot

Composing Normal Programs with Function Symbols

inferredcites →https://doi.org/10.1007/978-3-642-02846-5_40openalex-snapshot

One More Decidable Class of Finitely Ground Programs

inferredcites →https://doi.org/10.1007/978-3-642-04238-6_9openalex-snapshot

Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot

Foundations of Logic Programming

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

Classical negation in logic programs and disjunctive databases

inferredcites →https://doi.org/10.1016/0304-3975(92)00019-nopenalex-snapshot

Norms on terms and their use in proving universal termination of a logic program

inferredcites →https://doi.org/10.1016/j.artint.2004.02.001openalex-snapshot

Reasoning with infinite stable models

inferredcites →https://doi.org/10.1016/j.artint.2008.07.002openalex-snapshot

Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111]

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

On finitely recursive programs

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.3199227openalex-extracted

inferred← citeshttps://doi.org/10.1007/978-3-030-67438-0_6openalex-snapshot

Data Validation Meets Answer Set Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_3openalex-snapshot

A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions

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

Automata for infinite argumentation structures

inferred← citeshttps://doi.org/10.1016/j.websem.2016.02.002openalex-snapshot

A Rule-Based Agent-Oriented Approach for Supporting Weakly-Structured Scientific Workflows

inferred← citeshttps://doi.org/10.1017/s1471068416000569openalex-snapshot

ASPeRiX, a first-order forward chaining approach for answer set computing

inferred← citeshttps://doi.org/10.1017/s1471068418000285openalex-snapshot

Constraint Answer Set Programming without Grounding

inferred← citeshttps://doi.org/10.1017/s1471068422000084openalex-snapshot

ValAsp: A Tool for Data Validation in Answer Set Programming

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

Terminating Evaluation of Logic Programs with Finite Three-Valued Models

inferred← citeshttps://doi.org/10.20868/upm.thesis.58189openalex-snapshot

Advanced Evaluation Techniques for (Non)-Monotonic Reasoning Using Rules with Constraints

inferred← citeshttps://doi.org/10.3233/aic-2011-0509openalex-snapshot

Finitely recursive programs: Decidability and bottom–up computation

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

Proceedings 36th International Conference on Logic Programming (Technical Communications)

inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.49openalex-snapshot

An Answer Set Solver for non-Herbrand Programs: Progress Report

inferred← citeshttps://doi.org/10.48550/arxiv.1301.1387openalex-snapshot

Language ASP{f} with Arithmetic Expressions and Consistency-Restoring Rules

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.