On the public citation graph

Guarded Open Answer Set Programming

0 signed · 43 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/11431053_27openalex-snapshot
Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs
inferredcites →https://doi.org/10.1007/3-540-45402-0_20openalex-snapshot
Omega-Restricted Logic Programs
inferredcites →https://doi.org/10.1007/3-540-45402-0_38openalex-snapshot
The Smodels System
inferredcites →https://doi.org/10.1007/3-540-46767-x_13openalex-snapshot
Pushing Goal Derivation in DLP Computations
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
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-30504-0_9openalex-snapshot
Semantic Web Reasoning with Conceptual Logic Programs
inferredcites →https://doi.org/10.1007/b97867openalex-snapshot
The semantic Web : research and applications : first European Semantic Web Symposium, ESWS 2004, Heraklion, Crete, Greece, May 10-12, 2004 : proceedings
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
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.1017/cbo9780511543357openalex-snapshot
Knowledge Representation, Reasoning and Declarative Problem Solving
inferredcites →https://doi.org/10.1023/a:1004275029985openalex-snapshot
Modal Languages and Bounded Fragments of Predicate Logic
inferredcites →https://doi.org/10.1109/lics.1999.782585openalex-snapshot
Guarded fixed point logic
inferredcites →https://doi.org/10.1142/9789811223723_0002openalex-snapshot
Knowledge Representation
inferredcites →https://doi.org/10.1145/383779.383783openalex-snapshot
Strongly equivalent logic programs
inferredcites →https://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferredcites →https://doi.org/10.1145/504077.504078openalex-snapshot
The intuitionism behind Statecharts steps
inferredcites →https://doi.org/10.1145/504077.504079openalex-snapshot
Datalog LITE
inferredcites →https://doi.org/10.1145/588111.588137openalex-snapshot
Horn clauses and the fixpoint query hierarchy
inferredcites →https://doi.org/10.2307/2586808openalex-snapshot
On the Restraining Power of Guards
inferredcites →https://doi.org/10.5860/choice.33-0359openalex-snapshot
Foundations of databases
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0033openalex-snapshot
Reasoning in Open Domains

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11663881_11openalex-snapshot
Guarded Open Answer Set Programming with Generalized Literals
inferred← citeshttps://doi.org/10.1007/11811220_1openalex-snapshot
On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-30504-0_9openalex-snapshot
Semantic Web Reasoning with Conceptual Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_30openalex-snapshot
Tightly Integrated Probabilistic Description Logic Programs for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-77002-2_1openalex-snapshot
Towards Tractable Local Closed World Reasoning for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_9openalex-snapshot
Sixty Years of Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-642-00685-2_4openalex-snapshot
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_8openalex-snapshot
A Revised Concept of Safety for General Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_27openalex-snapshot
Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report)
inferred← citeshttps://doi.org/10.1007/s10115-010-0294-zopenalex-snapshot
A semantical framework for hybrid knowledge bases
inferred← citeshttps://doi.org/10.1016/j.jal.2006.02.001openalex-snapshot
Open answer set programming for the semantic web
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03007-6openalex-snapshot
Chapter 7 Answer Sets
inferred← citeshttps://doi.org/10.1017/s1471068407003201openalex-snapshot
Guarded hybrid knowledge bases
inferred← citeshttps://doi.org/10.1057/9781137030894_4openalex-snapshot
Sixty Years of Stable Models
inferred← citeshttps://doi.org/10.1145/1380572.1380575openalex-snapshot
Open answer set programming with guarded programs
inferred← citeshttps://doi.org/10.1613/jair.3873openalex-snapshot
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-99openalex-snapshot
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
inferred← citeshttps://doi.org/10.4018/978-1-59140-993-9openalex-snapshot
Encyclopedia of Internet Technologies and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.0811.0359openalex-snapshot
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination
inferred← citeshttps://doi.org/10.5555/1782254.1782256openalex-snapshot
Towards tractable local closed world reasoning for the semantic web
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.