On the public citation graph

The expressiveness of locally stratified programs

https://doi.org/10.1007/bf01534455
0 signed · 54 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.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferredcites →https://doi.org/10.1007/3-540-50701-9_27openalex-snapshot
Autoepistemic logic and formalization of commonsense reasoning preliminary report
inferredcites →https://doi.org/10.1007/978-1-4612-0649-1openalex-snapshot
Logic for Applications
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-662-12898-5openalex-snapshot
Recursion-Theoretic Hierarchies
inferredcites →https://doi.org/10.1007/bf00881799openalex-snapshot
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf01531080openalex-snapshot
A theory of nonmonotonic rule systems I
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/0743-1066(91)90003-8openalex-snapshot
Unsolvable problems for SLDNF resolution
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.50015-9openalex-snapshot
Logic Programming
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50008-7openalex-snapshot
On the Declarative Semantics of Logic Programs with Negation
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0019-9958(82)91234-7openalex-snapshot
The recursion-theoretic complexity of the semantics of predicate logic as a programming language
inferredcites →https://doi.org/10.1109/lics.1990.113736openalex-snapshot
A theory of nonmonotonic rule systems
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/298514.298564openalex-snapshot
The expressive powers of the logic programming semantics (extended abstract)
inferredcites →https://doi.org/10.1145/321160.321170openalex-snapshot
Computability of Recursive Functions
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
inferredcites →https://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.3233/fi-1990-13103openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs
inferredcites →https://doi.org/10.3233/fi-1991-14307openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs1
inferredcites →https://doi.org/10.3233/fi-1994-2144openalex-snapshot
THE COMPLEXITY OF LOCAL STRATIFICATION

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45402-0_8openalex-snapshot
On the Expressibility of Stable Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_8openalex-snapshot
Game characterizations of logic program properties
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_9openalex-snapshot
Simulations between programs as cellular automata
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_22openalex-snapshot
Automata and Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_9openalex-snapshot
Effectively Reasoning about Infinite Sets in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_17openalex-snapshot
Stable Models and an Alternative Logic Programming Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/s10472-005-7030-5openalex-snapshot
Logic programming with infinite sets
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90013-2openalex-snapshot
A context for belief revision: forward chaining-normal nonmonotomic rule systems
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferred← citeshttps://doi.org/10.1016/j.artint.2004.02.001openalex-snapshot
Reasoning with infinite stable models
inferred← citeshttps://doi.org/10.1016/s0743-1066(14)80008-3openalex-snapshot
The Stable Models of a Predicate Logic Program
inferred← citeshttps://doi.org/10.1017/s1471068403001777openalex-snapshot
On the expressibility of stable logic programming
inferred← citeshttps://doi.org/10.1023/a:1018913302060openalex-snapshot
A continuum of discrete systems
inferred← citeshttps://doi.org/10.1109/lics.1995.523255openalex-snapshot
Complexity of normal default logic and related modes of nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1145/1809842.1809866openalex-snapshot
Personalizing access control by generalizing access control
inferred← citeshttps://doi.org/10.1145/275487.275515openalex-snapshot
Complexity of nonrecursive logic programs with complex values
inferred← citeshttps://doi.org/10.1145/335168.335218openalex-snapshot
Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/383779.383789openalex-snapshot
Logic programming revisited
inferred← citeshttps://doi.org/10.3233/fi-1996-281203openalex-snapshot
Designing Dependencies
inferred← citeshttps://doi.org/10.3233/fi-1997-32203openalex-snapshot
Complexity of Recursive Normal Default Logic
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.261openalex-snapshot
Extensions of Answer Set Programming
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.