On the public citation graph

Computation of non-ground disjunctive well-founded semantics with constraint logic programming

https://doi.org/10.1007/bfb0023808
0 signed · 30 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-58792-6openalex-snapshot
Logic Program Synthesis and Transformation — Meta-Programming in Logic
inferredcites →https://doi.org/10.1007/3-540-58792-6_11openalex-snapshot
Partial deduction of disjunctive logic programs: A declarative approach
inferredcites →https://doi.org/10.1007/3-540-61630-6_19openalex-snapshot
Characterizing D-WFS: Confluence and iterated GCWA
inferredcites →https://doi.org/10.1007/3-540-63255-7openalex-snapshot
Logic Programming And Nonmonotonic Reasoning
inferredcites →https://doi.org/10.1007/3-540-63255-7_14openalex-snapshot
Computing non-ground representations of stable models
inferredcites →https://doi.org/10.1007/978-3-642-51136-3openalex-snapshot
Innovationen bei Rechen- und Kommunikationssystemen
inferredcites →https://doi.org/10.1007/978-3-642-51136-3_13openalex-snapshot
A Disjunctive Semantics Based on Unfolding and Bottom-Up Evaluation
inferredcites →https://doi.org/10.1007/bf03038308openalex-snapshot
Partial deduction of logic programs wrt well-founded semantics
inferredcites →https://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferredcites →https://doi.org/10.1016/0304-3975(94)00216-9openalex-snapshot
Computing minimal models by partial instantiation
inferredcites →https://doi.org/10.1016/0743-1066(94)00028-5openalex-snapshot
Efficient top-down computation of queries under the well-founded semantics
inferredcites →https://doi.org/10.1016/0743-1066(94)00105-fopenalex-snapshot
Analysis of residuating logic programs
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
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.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint logic programming
inferredcites →https://doi.org/10.1109/tkde.2004.1269660openalex-snapshot
IEEE Transactions on Knowledge and Data Engineering
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation

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_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_14openalex-snapshot
Computing non-ground representations of stable models
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_25openalex-snapshot
DisLoP: Towards a disjunctive logic programming system
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10003-1openalex-snapshot
A framework to incorporate non-monotonic reasoning into constraint logic programming
inferred← citeshttps://doi.org/10.1023/a:1005952908693openalex-snapshot
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
inferred← citeshttps://doi.org/10.1023/a:1022976016809openalex-snapshot
Automated Deduction Techniques for the Management of Personalized Documents
inferred← citeshttps://doi.org/10.1109/69.755623openalex-snapshot
Nonmonotonic logic programming
inferred← citeshttps://doi.org/10.1109/tkde.2004.1269672openalex-snapshot
Optimal models of disjunctive logic programs: semantics, complexity, and computation
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.