On the public citation graph
Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates
0 signed · 46 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.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferredcites →https://doi.org/10.1007/11546207_10openalex-snapshot
Answer Sets for Propositional Theories
inferredcites →https://doi.org/10.1007/3-540-40006-0_4openalex-snapshot
Semi-qualitative Reasoning about Distances: A Preliminary Report
inferredcites →https://doi.org/10.1007/3-540-45628-7openalex-snapshot
Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part I
inferredcites →https://doi.org/10.1007/3-540-45632-5_16openalex-snapshot
Representing Knowledge in A-Prolog
inferredcites →https://doi.org/10.1007/3-540-45635-x_22openalex-snapshot
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
inferredcites →https://doi.org/10.1007/978-3-540-24609-1_19openalex-snapshot
Partial Stable Models for Logic Programs with Aggregates
inferredcites →https://doi.org/10.1007/978-3-540-24609-1_20openalex-snapshot
Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs
inferredcites →https://doi.org/10.1007/978-3-540-30227-8_19openalex-snapshot
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferredcites →https://doi.org/10.1016/s0004-3702(03)00078-xopenalex-snapshot
Enhancing disjunctive logic programming systems by SAT checkers
inferredcites →https://doi.org/10.1017/cbo9780511543357openalex-snapshot
Knowledge Representation, Reasoning and Declarative Problem Solving
inferredcites →https://doi.org/10.1145/1055686.1055690openalex-snapshot
Comparisons and computation of well-founded semantics for disjunctive logic programs
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferredcites →https://doi.org/10.13140/2.1.3855.4561openalex-snapshot
Declarative and Computational Properties of Logic Programs with Aggregates.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-17822-6_16openalex-snapshot
Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies
inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_16openalex-snapshot
Explaining Inconsistency in Answer Set Programs and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-30504-0_7openalex-snapshot
Well-Founded Semantics for Description Logic Programs in the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_9openalex-snapshot
Generic Tableaux for Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_10openalex-snapshot
The DLV Project: A Tour from Theory and Research to Applications and Market
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_17openalex-snapshot
On Reductive Semantics of Aggregates in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_4openalex-snapshot
First-Order Encodings for Modular Nonmonotonic Datalog Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_34openalex-snapshot
Stepwise Debugging of Description-Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_13openalex-snapshot
Exploiting Unfounded Sets for HEX-Program Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_7openalex-snapshot
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
inferred← citeshttps://doi.org/10.1017/s1471068408003323openalex-snapshot
Design and implementation of aggregate functions in the DLV system
inferred← citeshttps://doi.org/10.1017/s1471068413000410openalex-snapshot
SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support
inferred← citeshttps://doi.org/10.1017/s147106841800056xopenalex-snapshot
Inlining External Sources in Answer Set Programs
inferred← citeshttps://doi.org/10.1017/s1471068419000255openalex-snapshot
Inconsistency Proofs for ASP: The ASP - DRUPE Format
inferred← citeshttps://doi.org/10.1145/1877714.1877717openalex-snapshot
Well-founded semantics for description logic programs in the semantic web
inferred← citeshttps://doi.org/10.1145/2480759.2480767openalex-snapshot
Tableau Calculi for Logic Programs under Answer Set Semantics
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8213openalex-snapshot
A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10671openalex-snapshot
On Equivalence and Inconsistency of Answer Set Programs with External Sources
inferred← citeshttps://doi.org/10.1613/jair.1.11221openalex-snapshot
Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access
inferred← citeshttps://doi.org/10.1613/jair.4175openalex-snapshot
Efficient HEX-Program Evaluation Based on Unfounded Sets
inferred← citeshttps://doi.org/10.22215/etd/2007-06172openalex-snapshot
Optimizing and implementing repair programs for consistent query answering in databases
inferred← citeshttps://doi.org/10.3233/ia-2011-0023openalex-snapshot
Efficient recursive aggregate evaluation in logic programming
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.222openalex-snapshot
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.235openalex-snapshot
Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.469openalex-snapshot
Answer Set Programming with External Sources
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1390openalex-snapshot
Eliminating Unfounded Set Checking for HEX-Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4596openalex-snapshot
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00119openalex-snapshot
Technical Report: Inconsistency in Answer Set Programs and Extensions
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.