On the public citation graph

Prolegomena to logic programming for non-monotonic reasoning

https://doi.org/10.1007/bfb0023799
0 signed · 111 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/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferredcites →https://doi.org/10.1007/3-540-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-50701-9_21openalex-snapshot
Compiling circumscriptive theories into logic programs
inferredcites →https://doi.org/10.1007/3-540-54009-1_25openalex-snapshot
A database needs two kinds of negation
inferredcites →https://doi.org/10.1007/3-540-54563-8openalex-snapshot
Methodologies for Intelligent Systems
inferredcites →https://doi.org/10.1007/3-540-55602-8openalex-snapshot
Automated Deduction—CADE-11
inferredcites →https://doi.org/10.1007/3-540-55602-8_180openalex-snapshot
Embedding negation as failure into a model generation theorem prover
inferredcites →https://doi.org/10.1007/3-540-55930-2_15openalex-snapshot
Legislation as logic programs
inferredcites →https://doi.org/10.1007/3-540-57530-8_16openalex-snapshot
Bottom-up query evaluation with partially ordered defaults
inferredcites →https://doi.org/10.1007/3-540-58025-5openalex-snapshot
Extensions of Logic Programming
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_1openalex-snapshot
Hyper tableaux
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-1-4612-5196-5_8openalex-snapshot
Towards a Logical Reconstruction of Relational Database Theory
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
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/978-3-642-76274-1_1openalex-snapshot
Problems and Promises of Computational Logic
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
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-94-015-8531-6_14openalex-snapshot
Legislation as Logic Programs
inferredcites →https://doi.org/10.1007/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1007/bf00881799openalex-snapshot
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferredcites →https://doi.org/10.1007/bf00883931openalex-snapshot
A logic programming system for nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferredcites →https://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf03037168openalex-snapshot
Acyclic programs
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bf03037170openalex-snapshot
Logic programs with exceptions
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bfb0023798openalex-snapshot
Non-Monotonic Extensions of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0030659openalex-snapshot
Samantics of normal and disjunctive logic programs a unifying framework
inferredcites →https://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferredcites →https://doi.org/10.1007/bfb0030664openalex-snapshot
Static semantics as program transformation and well-founded computation
inferredcites →https://doi.org/10.1007/bfb0030665openalex-snapshot
Magic computation for well-founded semantics
inferredcites →https://doi.org/10.1007/bfb0030666openalex-snapshot
Computing stable and partial stable models of extended disjunctive logic programs
inferredcites →https://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(85)90042-6openalex-snapshot
Semantical considerations on nonmonotonic logic
inferredcites →https://doi.org/10.1016/0004-3702(86)90068-8openalex-snapshot
Making believers out of computers
inferredcites →https://doi.org/10.1016/0004-3702(96)00007-0openalex-snapshot
Artificial intelligence: A modern approach
inferredcites →https://doi.org/10.1016/0168-0072(94)90010-8openalex-snapshot
Computing definite logic programs by partial instantiation
inferredcites →https://doi.org/10.1016/0304-3975(93)90073-3openalex-snapshot
Propositional circumscription and extended closed-world reasoning are ΠP2-complete
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(85)90013-5openalex-snapshot
A basis for deductive database systems
inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot
A basis for deductive database systems II
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
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(92)90019-yopenalex-snapshot
A procedural semantics for well-founded negation in logic programs
inferredcites →https://doi.org/10.1016/0743-1066(93)90028-fopenalex-snapshot
An overview of nonmonotonic reasoning and logic programming
inferredcites →https://doi.org/10.1016/0743-1066(93)90032-copenalex-snapshot
Non-monotonic reasoning with logic programming
inferredcites →https://doi.org/10.1016/0743-1066(93)90034-eopenalex-snapshot
A goal-oriented approach to computing the well-founded semantics
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)00106-gopenalex-snapshot
Bottom-up computation of perfect models for disjunctive theories
inferredcites →https://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
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/0925-2312(95)90020-9openalex-snapshot
Artificial Intelligence: A Modern Approach
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50028-9openalex-snapshot
Possible Model Semantics for Disjunctive Databases
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/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
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/s0743-1066(97)00073-3openalex-snapshot
Tabulated resolution for the well-founded semantics
inferredcites →https://doi.org/10.1093/oso/9780198537922.003.0009openalex-snapshot
Negation as Failure, Completion and Stratification
inferredcites →https://doi.org/10.1109/tkde.2004.1269660openalex-snapshot
IEEE Transactions on Knowledge and Data Engineering
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/182591.182639openalex-snapshot
Adding disjunction to datalog (extended abstract)
inferredcites →https://doi.org/10.1145/195613.195637openalex-snapshot
Mixed integer programming methods for computing nonmonotonic deductive databases
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.1145/320083.320088openalex-snapshot
On semantic issues connected with incomplete information databases
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/359131.359136openalex-snapshot
Algorithm = logic + control
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.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferredcites →https://doi.org/10.1145/74014.74016openalex-snapshot
The treatment of negation in logic programs for representing legislation
inferredcites →https://doi.org/10.1145/800228.806939openalex-snapshot
Prolog - the language and its implementation compared with Lisp
inferredcites →https://doi.org/10.1145/872736.806939openalex-snapshot
Prolog - the language and its implementation compared with Lisp
inferredcites →https://doi.org/10.1145/963927.963931openalex-snapshot
Super logic programs
inferredcites →https://doi.org/10.21236/ada232064openalex-snapshot
Generalized Disjunctive Well-Founded Semantics for Logic Programs
inferredcites →https://doi.org/10.3233/fi-1990-13105openalex-snapshot
Some Remarks on the Completed Database1
inferredcites →https://doi.org/10.3233/fi-1995-2233openalex-snapshot
A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES
inferredcites →https://doi.org/10.3233/fi-1995-2234openalex-snapshot
A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIES
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0006openalex-snapshot
Implementing Stable Semantics by Linear Programming
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0007openalex-snapshot
Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0026openalex-snapshot
Diagnosis and Debugging as Contradiction Removal

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-45327-x_41openalex-snapshot
Spatial Agents Implemented in a Logical Expressible Language
inferred← citeshttps://doi.org/10.1007/3-540-58495-1_51openalex-snapshot
Partial evaluation and relevance for approximations of the stable semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-70829-2_5openalex-snapshot
Collaborative vs. Conflicting Learning, Evolution and Argumentation
inferred← citeshttps://doi.org/10.1007/bf03037475openalex-snapshot
Belief revision via Lamarckian evolution
inferred← citeshttps://doi.org/10.1007/bfb0055502openalex-snapshot
Some notes on knowledge assimilation in deductive databases
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00033-6openalex-snapshot
Relating defeasible and normal logic programming through transformation properties
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00073-4openalex-snapshot
Abductive logic programming and disjunctive logic programming: their relationship and transferability
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00074-6openalex-snapshot
An abductive approach to disjunctive logic programming
inferred← citeshttps://doi.org/10.1023/a:1007681906490openalex-snapshot
Strategies in Combined Learning via Logic Programs
inferred← citeshttps://doi.org/10.1109/wcre.1998.723183openalex-snapshot
Program comprehension in multi-language systems
inferred← citeshttps://doi.org/10.20868/upm.thesis.37873openalex-snapshot
Extending the expressiveness of fuzzy logic languages
inferred← citeshttps://doi.org/10.3233/ia-2011-0007openalex-snapshot
Evolving reactive logic programs
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.