On the public citation graph

Acyclic programs

https://doi.org/10.1007/bf03037168
0 signed · 107 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/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(87)90043-9openalex-snapshot
Nonmonotonic logic and temporal projection
inferredcites →https://doi.org/10.1016/0743-1066(89)90022-8openalex-snapshot
Signed data dependencies in logic programs
inferredcites →https://doi.org/10.1016/0890-5401(91)90073-bopenalex-snapshot
General logical databases and programs: Default logic semantics and stratification
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50033-7openalex-snapshot
Some Philosophical Problems from the Standpoint of Artificial Intelligence
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in 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.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/c2013-0-07698-0openalex-snapshot
The Frame Problem in Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
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.3233/fi-1990-13103openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11506676_15openalex-snapshot
On Termination of Binary CLP Programs
inferred← citeshttps://doi.org/10.1007/11533092_5openalex-snapshot
Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs
inferred← citeshttps://doi.org/10.1007/11536314_20openalex-snapshot
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_10openalex-snapshot
Properties and Complexity in Feasible Logic-Based Argumentation for Electronic Commerce
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_5openalex-snapshot
Logic, Knowledge Representation, and Bayesian Decision Theory
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_11openalex-snapshot
Negation as Failure through Abduction: Reasoning about Termination
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_8openalex-snapshot
Transformation Systems and Nondeclarative Properties
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_16openalex-snapshot
Representing Knowledge in A-Prolog
inferred← citeshttps://doi.org/10.1007/3-540-48751-4_26openalex-snapshot
Some Properties of Inverse Resolution in Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_5openalex-snapshot
Tutorial on termination of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_12openalex-snapshot
Three-valued completion for abductive logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_51openalex-snapshot
Probabilistic logic programming and Bayesian networks
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_44openalex-snapshot
TermiLog: A system for checking termination of queries to logic programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_12openalex-snapshot
Automatic Termination Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-00461-3_3openalex-snapshot
A Credal Extension of Independent Choice Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-68436-5_62-1openalex-snapshot
Abductive Logic Programming and Linear Algebraic Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-10135-9_62openalex-snapshot
Abductive Logic Programming and Linear Algebraic Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_13openalex-snapshot
Linear Algebraic Abduction with Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-61581-3_40openalex-snapshot
The Complexity of Inferences and Explanations in Probabilistic Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_12openalex-snapshot
Characterisations of Termination in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_13openalex-snapshot
On the Inference of Natural Level Mappings
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_14openalex-snapshot
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_4openalex-snapshot
Declarative Semantics of Input Consuming Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_30openalex-snapshot
Logic Programs with Annotated Disjunctions
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_18openalex-snapshot
Generating All Abductive Explanations for Queries on Propositional Horn Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-72982-2_21openalex-snapshot
Decidability Under the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-78469-2_16openalex-snapshot
Applying Inductive Logic Programming to Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-540-78652-8_8openalex-snapshot
The Independent Choice Logic and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-642-04584-4_5openalex-snapshot
Incremental Declarative Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-31951-8_8openalex-snapshot
Learning Directed Relational Models with Recursive Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-642-39643-4_39openalex-snapshot
Answers That Have Quality
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_15openalex-snapshot
Prolog and ASP Inference under One Roof
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_8openalex-snapshot
A Survey of Paraconsistent Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_7openalex-snapshot
Explaining Explanations in Probabilistic Logic Programming
inferred← citeshttps://doi.org/10.1007/bf01190828openalex-snapshot
A declarative approach for first-order built-in's of Prolog
inferred← citeshttps://doi.org/10.1007/bf01530760openalex-snapshot
Negation as failure for disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf03037184openalex-snapshot
Logic programming, abduction and probability
inferred← citeshttps://doi.org/10.1007/bf03037342openalex-snapshot
Undecidable goals for completed acyclic programs
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0026831openalex-snapshot
The notion of floundering for SLDNF-resolution revisited
inferred← citeshttps://doi.org/10.1007/s10472-009-9116-yopenalex-snapshot
Integrating answer set programming and constraint logic programming
inferred← citeshttps://doi.org/10.1007/s10472-024-09925-xopenalex-snapshot
Sequential composition of propositional logic programs
inferred← citeshttps://doi.org/10.1007/s10994-011-5247-6openalex-snapshot
Applying the information bottleneck to statistical relational learning
inferred← citeshttps://doi.org/10.1007/s10994-012-5289-4openalex-snapshot
Learning graphical models for relational data via lattice search
inferred← citeshttps://doi.org/10.1007/s10994-012-5308-5openalex-snapshot
Learning directed relational models with recursive dependencies
inferred← citeshttps://doi.org/10.1007/s10994-013-5353-8openalex-snapshot
Learning from interpretation transition
inferred← citeshttps://doi.org/10.1007/s10994-020-05911-6openalex-snapshot
Probabilistic inductive constraint logic
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90061-fopenalex-snapshot
Probabilistic Horn abduction and Bayesian networks
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00044-8openalex-snapshot
Three-valued completion for abductive logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90014-8openalex-snapshot
Strong termination of logic programs
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/0743-1066(94)90004-3openalex-snapshot
A methodology for proving termination of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90051-5openalex-snapshot
A new definition of SLDNF-resolution
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00090-9openalex-snapshot
On termination of general logic programs w.R.T. constructive negation
inferred← citeshttps://doi.org/10.1016/j.artint.2004.02.001openalex-snapshot
Reasoning with infinite stable models
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.10.001openalex-snapshot
Negative probabilities in probabilistic logic programs
inferred← citeshttps://doi.org/10.1016/j.pmcj.2008.04.002openalex-snapshot
Efficient profile aggregation and policy evaluation in a middleware for adaptive mobile applications
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00027-1openalex-snapshot
The independent choice logic for modelling multiple agents under uncertainty
inferred← citeshttps://doi.org/10.1016/s0010-4825(97)00015-2openalex-snapshot
Efficient temporal probabilistic reasoning via context-sensitive model construction
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00128-4openalex-snapshot
Answering queries from context-sensitive probabilistic knowledge bases
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00140-9openalex-snapshot
Reasoning about effects of concurrent actions
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10025-0openalex-snapshot
Termination of well-moded programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00071-0openalex-snapshot
Abducing through negation as failure: stable models within the independent choice logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00116-1openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.1017/s1471068422000060openalex-snapshot
A Brief History of Updates of Answer-Set Programs
inferred← citeshttps://doi.org/10.1023/a:1008376514077openalex-snapshot
Approximating the Semantics of Logic Programs by Recurrent Neural Networks
inferred← citeshttps://doi.org/10.1023/a:1018926021566openalex-snapshot
Computing extended abduction through transaction programs
inferred← citeshttps://doi.org/10.1023/a:1018961217989openalex-snapshot
Relating logic programming theories of actions and partial order planning
inferred← citeshttps://doi.org/10.1093/jigpal/jzp025openalex-snapshot
Extended semantics and inference for the Independent Choice Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzt015openalex-snapshot
Abduction, unpredictability and Garden of Eden
inferred← citeshttps://doi.org/10.1109/69.298170openalex-snapshot
First-order logic characterization of program properties
inferred← citeshttps://doi.org/10.1109/ictai52525.2021.00040openalex-snapshot
Linear Algebraic Computation of Propositional Horn Abduction
inferred← citeshttps://doi.org/10.1109/mobiq.2004.1331735openalex-snapshot
Profile aggregation and policy evaluation for adaptive internet services
inferred← citeshttps://doi.org/10.1109/tai.1995.479376openalex-snapshot
A formal semantics for mOPS5
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1996.tb00272.xopenalex-snapshot
HYPOTHETICAL REASONING ABOUT ACTIONS: FROM SITUATION CALCULUS TO EVENT CALCULUS
inferred← citeshttps://doi.org/10.1142/s0218001400000052openalex-snapshot
KNOWLEDGE BASE REFORMATION: PREPARING FIRST-ORDER THEORIES FOR EFFICIENT PROPOSITIONAL REASONING
inferred← citeshttps://doi.org/10.1145/1284320.1284323openalex-snapshot
On computing all abductive explanations from a propositional Horn theory
inferred← citeshttps://doi.org/10.1145/1380572.1380576openalex-snapshot
Reasoning with recursive loops under the PLP framework
inferred← citeshttps://doi.org/10.1145/1380572.1380578openalex-snapshot
Verifiable agent interaction in abductive logic programming
inferred← citeshttps://doi.org/10.1145/1410234.1410235openalex-snapshot
Status-Based Access Control
inferred← citeshttps://doi.org/10.1145/183432.183434openalex-snapshot
Transforming acyclic programs
inferred← citeshttps://doi.org/10.1145/330643.330645openalex-snapshot
Constraint-based termination analysis of logic programs
inferred← citeshttps://doi.org/10.1145/383779.383782openalex-snapshot
Incremental execution of guarded theories
inferred← citeshttps://doi.org/10.1145/773184.773193openalex-snapshot
Termination of well-typed logic programs
inferred← citeshttps://doi.org/10.4204/eptcs.320.1openalex-snapshot
A Historical Account of My Early Research Interests
inferred← citeshttps://doi.org/10.4204/eptcs.416.16openalex-snapshot
Graphical Conditions for the Existence, Unicity and Number of Regular Models
inferred← citeshttps://doi.org/10.5281/zenodo.197474openalex-snapshot
FIGURE 5–6 in Description of two new species of Hypselotropis Jekel with a revised key and phylogenetic reanalysis of the genus (Coleoptera, Anthribidae, Anthribinae)
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.