On the public citation graph
Overview of disjunctive logic programming
0 signed · 138 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52885-7_82openalex-snapshot
Generalized well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/3-540-54563-8_109openalex-snapshot
WF 3: A semantics for negation in normal disjunctive logic programs
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-56039-4_31openalex-snapshot
Semantics of disjunctive deductive databases
inferredcites →https://doi.org/10.1007/3-540-56503-5_10openalex-snapshot
The complexity of logic-based abduction
inferredcites →https://doi.org/10.1007/3-540-56804-2_1openalex-snapshot
On extended disjunctive logic programs
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-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/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1007/bf00248321openalex-snapshot
Weak Generalized Closed World Assumption
inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1007/bf00881914openalex-snapshot
Ordered model trees: A normal form for disjunctive deductive databases
inferredcites →https://doi.org/10.1007/bf01530760openalex-snapshot
Negation as failure for disjunctive logic programming
inferredcites →https://doi.org/10.1007/bf01530761openalex-snapshot
Propositional semantics for disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf01530762openalex-snapshot
Logic programming and reasoning with incomplete information
inferredcites →https://doi.org/10.1007/bf01530763openalex-snapshot
Avoiding duplicate proofs with the foothold refinement
inferredcites →https://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferredcites →https://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bf03037407openalex-snapshot
The Alexander Method — A technique for the processing of recursive axioms in deductive databases
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1007/bfb0012837openalex-snapshot
Procedural interpretation of non-horn logic programs
inferredcites →https://doi.org/10.1007/bfb0012838openalex-snapshot
Recursive query answering with non-horn clauses
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0030658openalex-snapshot
From disjunctive programs to abduction
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)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
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)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
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(90)90101-5openalex-snapshot
Nonmonotonic reasoning, preferential models and cumulative logics
inferredcites →https://doi.org/10.1016/0020-0190(82)90035-7openalex-snapshot
An extension to linear resolution with selection function
inferredcites →https://doi.org/10.1016/0020-0190(90)90012-mopenalex-snapshot
Generalized Closed World Assumption is II02-Complete
inferredcites →https://doi.org/10.1016/0304-3975(51)90010-2openalex-snapshot
An efficient strategy for non-Horn deductive databases
inferredcites →https://doi.org/10.1016/0304-3975(84)90017-3openalex-snapshot
Closures and fairness in the semantics of programming logic
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/0743-1066(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.1016/0743-1066(88)90006-4openalex-snapshot
Perspectives in deductive databases
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(90)90033-2openalex-snapshot
A fixpoint semantics for disjunctive 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)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
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)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/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferredcites →https://doi.org/10.1016/b978-0-12-450010-5.50022-0openalex-snapshot
Circumscription and Disjunctive Logic Programming
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-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
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/b978-0-934613-40-8.50015-4openalex-snapshot
Compiling the GCWA in Indefinite Deductive Databases
inferredcites →https://doi.org/10.1016/s0743-1066(85)80003-0openalex-snapshot
N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
inferredcites →https://doi.org/10.1093/logcom/2.3.397openalex-snapshot
Complexity Results for Nonmonotonic Logics
inferredcites →https://doi.org/10.1109/icde.1990.113503openalex-snapshot
On representing indefinite and maybe information in relational databases: a generalization
inferredcites →https://doi.org/10.1145/195613.195637openalex-snapshot
Mixed integer programming methods for computing nonmonotonic deductive databases
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/35043.35046openalex-snapshot
The early years of logic programming
inferredcites →https://doi.org/10.1145/5383.5388openalex-snapshot
A sound and sometimes complete query evaluation algorithm for relational databases with null values
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.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferredcites →https://doi.org/10.1145/73721.73726openalex-snapshot
Complexity of query processing in databases with OR-objects
inferredcites →https://doi.org/10.1145/73721.73727openalex-snapshot
A sound and complete query evaluation algorithm for relational databases with disjunctive information
inferredcites →https://doi.org/10.1145/77643.77644openalex-snapshot
Indefinite and maybe information in relational databases
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001051openalex-snapshot
Nonmonotonic Reasoning
inferredcites →https://doi.org/10.21236/ada232064openalex-snapshot
Generalized Disjunctive Well-Founded Semantics for Logic Programs
inferredcites →https://doi.org/10.3233/fi-1994-201236openalex-snapshot
SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0034openalex-snapshot
Causal Models of Disjunctive Logic Programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0035openalex-snapshot
An Axiomatic Approach to Semantics of Disjunctive Programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0050openalex-snapshot
On the Equivalence between Disjunctive and Abductive Logic 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/11837862_16openalex-snapshot
Process Representation and Reasoning Using a Logic Formalism with Object-Oriented Features
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_17openalex-snapshot
Procedural Semantics for Fuzzy Disjunctive Programs
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_25openalex-snapshot
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
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-46767-x_20openalex-snapshot
Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_27openalex-snapshot
A deductive system for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_1openalex-snapshot
Introduction to Logic-Based Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_4openalex-snapshot
Declarative Problem-Solving Using the DLV System
inferred← citeshttps://doi.org/10.1007/978-1-4615-6245-0_4openalex-snapshot
Uncertainty in Intelligent Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_12openalex-snapshot
Geometric Rules in Infinitary Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-39615-4_7openalex-snapshot
Model and Fixpoint Semantics for Fuzzy Disjunctive Programs with Weak Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_1openalex-snapshot
Foundations of Rule-Based Query Answering
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_31openalex-snapshot
An ASP-Based System for e-Tourism
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_27openalex-snapshot
ASP at Work: Spin-off and Applications of the DLV System
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_7openalex-snapshot
Equivalence between Extended Datalog Programs — A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_32openalex-snapshot
Disjunctive Programs with Set Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-37422-7_15openalex-snapshot
Choosing Compliance Solutions through Stakeholder Preferences
inferred← citeshttps://doi.org/10.1007/978-3-662-45501-2_1openalex-snapshot
Exploring Legal Business Process Paths
inferred← citeshttps://doi.org/10.1007/bf02916841openalex-snapshot
Consistency-based abduction with extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf02916880openalex-snapshot
Argumentation in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf02943187openalex-snapshot
The least fixpoint transformation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0054794openalex-snapshot
Abduction, argumentation and bi-disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/s10472-008-9086-5openalex-snapshot
Complexity results for answer set programming with bounded predicate arities and implications
inferred← citeshttps://doi.org/10.1007/s10472-008-9087-4openalex-snapshot
On look-ahead heuristics in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/s10472-008-9090-9openalex-snapshot
Enhancing DLV instantiator by backjumping techniques
inferred← citeshttps://doi.org/10.1007/s13132-022-00917-yopenalex-snapshot
Chronological Evolution of the Information-Driven Decision-Making Process (1950–2020)
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.ijar.2020.07.004openalex-snapshot
The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00207-2openalex-snapshot
Logic programming and knowledge representation—The A-Prolog perspective
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00129-1openalex-snapshot
Expressive power and complexity of partial models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00004-2openalex-snapshot
Argumentation-based abduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00027-7openalex-snapshot
Expressiveness of stable model semantics for disjunctive logic programs with functions
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.1017/bsl.2015.7openalex-snapshot
GEOMETRISATION OF FIRST-ORDER LOGIC
inferred← citeshttps://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/1055686.1055690openalex-snapshot
Comparisons and computation of well-founded semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1145/1149114.1149117openalex-snapshot
The DLV system for knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-1-64-81openalex-snapshot
Default Negation as Explicit Negation plus Update
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.3233/fi-2010-357openalex-snapshot
A Logic-Based System for e-Tourism
inferred← citeshttps://doi.org/10.3390/math12132120openalex-snapshot
Synthesis of Optimal Correction Functions in the Class of Disjunctive Normal Forms
inferred← citeshttps://doi.org/10.4018/ijbir.2019010101openalex-snapshot
Tackling Lack of Motivation in Aspirational Analytics Companies
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0311007openalex-snapshot
Parametric Connectives in Disjunctive Logic 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.