On the public citation graph

Efficient HEX-Program Evaluation Based on Unfounded Sets

0 signed · 67 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.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferredcites →https://doi.org/10.1007/11546207_4openalex-snapshot
Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates
inferredcites →https://doi.org/10.1007/11546207_44openalex-snapshot
cmodels – SAT-Based Disjunctive Answer Set Solver
inferredcites →https://doi.org/10.1007/11762256_22openalex-snapshot
Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning
inferredcites →https://doi.org/10.1007/3-540-45757-7_10openalex-snapshot
Polynomial-Length Planning Spans the Polynomial Hierarchy
inferredcites →https://doi.org/10.1007/978-3-540-24599-5_31openalex-snapshot
Loop Formulas for Disjunctive Logic Programs
inferredcites →https://doi.org/10.1007/978-3-540-72200-7_19openalex-snapshot
Conditional Planning with External Functions
inferredcites →https://doi.org/10.1007/978-3-540-74610-2_40openalex-snapshot
Computing Fuzzy Answer Sets Using dlvhex
inferredcites →https://doi.org/10.1007/978-3-642-02846-5_22openalex-snapshot
Constraint Answer Set Solving
inferredcites →https://doi.org/10.1007/978-3-642-15918-3_24openalex-snapshot
Processing RIF and OWL2RL within DLVHEX
inferredcites →https://doi.org/10.1007/978-3-642-20895-9_10openalex-snapshot
Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
inferredcites →https://doi.org/10.1007/978-3-642-25073-6_40openalex-snapshot
Extending Logic Programs with Description Logic Expressions for the Semantic Web
inferredcites →https://doi.org/10.1007/978-3-642-25364-5_46openalex-snapshot
A Logical Approach to Web User Interface Adaptation
inferredcites →https://doi.org/10.1007/978-3-642-33353-8_13openalex-snapshot
Exploiting Unfounded Sets for HEX-Program Evaluation
inferredcites →https://doi.org/10.1007/bf00883932openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/s10472-009-9111-3openalex-snapshot
Exploiting conjunctive queries in description logic programs
inferredcites →https://doi.org/10.1016/0004-3702(94)00041-xopenalex-snapshot
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
inferredcites →https://doi.org/10.1016/j.artint.2004.04.004openalex-snapshot
ASSAT: computing answer sets of a logic program by SAT solvers
inferredcites →https://doi.org/10.1016/j.artint.2007.05.003openalex-snapshot
Computing ideal sceptical argumentation
inferredcites →https://doi.org/10.1016/j.artint.2008.04.002openalex-snapshot
Combining answer set programming with description logics for the Semantic Web
inferredcites →https://doi.org/10.1016/j.artint.2009.09.001openalex-snapshot
The computational complexity of ideal semantics
inferredcites →https://doi.org/10.1016/j.artint.2010.04.002openalex-snapshot
Semantics and complexity of recursive aggregates in answer set programming
inferredcites →https://doi.org/10.1016/j.artint.2012.04.001openalex-snapshot
Conflict-driven answer set solving: From theory to practice
inferredcites →https://doi.org/10.1016/s0004-3702(01)00064-9openalex-snapshot
Local models semantics, or contextual reasoning = locality + compatibility
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.1080/19462166.2010.486479openalex-snapshot
Answer-set programming encodings for argumentation frameworks
inferredcites →https://doi.org/10.1109/wi.2006.64openalex-snapshot
dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics
inferredcites →https://doi.org/10.1145/1119439.1119440openalex-snapshot
Unfolding partiality and disjunctions in stable model semantics
inferredcites →https://doi.org/10.1145/1149114.1149117openalex-snapshot
The DLV system for knowledge representation and reasoning
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/1452567.1452572openalex-snapshot
Ranking semantic information for e-government
inferredcites →https://doi.org/10.1145/2043174.2043195openalex-snapshot
Answer set programming at a glance
inferredcites →https://doi.org/10.1186/1471-2105-8-377openalex-snapshot
Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies
inferredcites →https://doi.org/10.22028/d291-24896openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
inferredcites →https://doi.org/10.4230/lipics.iclp.2010.24openalex-snapshot
HEX Programs with Action Atoms
inferredcites →https://doi.org/10.4230/lipics.iclp.2012.188openalex-snapshot
Answer Set Solving with Lazy Nogood Generation
inferredcites →https://doi.org/10.48550/arxiv.1301.1390openalex-snapshot
Eliminating Unfounded Set Checking for HEX-Programs
inferredcites →https://doi.org/10.48550/arxiv.1401.4596openalex-snapshot
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-185openalex-snapshot
Well-supported semantics for description logic programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0014openalex-snapshot
Splitting a Logic Program

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-030-19570-0_39openalex-snapshot
The Hexlite Solver
inferred← citeshttps://doi.org/10.1007/978-3-030-20528-7_24openalex-snapshot
Pruning External Minimality Checking for ASP Using Semantic Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_30openalex-snapshot
Computing Repairs for Inconsistent DL-programs over $\mathcal{EL}$ Ontologies
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-61033-7_7openalex-snapshot
Answer Set Programming with External Source Access
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.1016/j.artint.2016.01.003openalex-snapshot
Domain expansion for ASP-programs with external sources
inferred← citeshttps://doi.org/10.1016/j.artint.2016.06.003openalex-snapshot
Data repair of inconsistent nonmonotonic description logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103402openalex-snapshot
Pruning external minimality checking for answer set programs using semantic dependencies
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103902openalex-snapshot
Hybrid planning for challenging construction problems: An Answer Set Programming approach
inferred← citeshttps://doi.org/10.1017/s1471068415000113openalex-snapshot
A model building framework for answer set programming with external computations
inferred← citeshttps://doi.org/10.1017/s1471068415000228openalex-snapshot
Rewriting recursive aggregates in answer set programming: back to monotonicity
inferred← citeshttps://doi.org/10.1017/s147106841500023xopenalex-snapshot
Complexity and compilation of GZ-aggregates in answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068416000211openalex-snapshot
The dlvhex system for knowledge representation: recent advances (system description)
inferred← citeshttps://doi.org/10.1017/s147106841800056xopenalex-snapshot
Inlining External Sources in Answer Set Programs
inferred← citeshttps://doi.org/10.1109/bracis.2015.34openalex-snapshot
Looking at the Bottom and the Top: A Hybrid Logical Relational Learning System Based on Answer Sets
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8874openalex-snapshot
Exploiting Support Sets for Answer Set Programs with External Evaluations
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10096openalex-snapshot
Boolean Functions with Ordered Domains in Answer Set Programming
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.1609/aaai.v31i1.10672openalex-snapshot
Efficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining
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.5047openalex-snapshot
Computing Repairs of Inconsistent DL-Programs over EL Ontologies
inferred← citeshttps://doi.org/10.24963/ijcai.2017/141openalex-snapshot
Lazy-Grounding for Answer Set Programs with External Source Access
inferred← citeshttps://doi.org/10.24963/ijcai.2017/172openalex-snapshot
Conflict-driven ASP Solving with External Sources and Program Splits
inferred← citeshttps://doi.org/10.48550/arxiv.1905.02428openalex-snapshot
Integrated Algorithms for HEX-Programs and Applications in Machine Learning
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.