On the public citation graph
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
0 signed · 87 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/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf02341854openalex-snapshot
Stable and extension class theory for logic programs and default logics
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(88)90021-5openalex-snapshot
On the relation between default and autoepistemic logic
inferredcites →https://doi.org/10.1016/0304-3975(92)90019-copenalex-snapshot
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
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.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
inferredcites →https://doi.org/10.3233/fi-1989-12209openalex-snapshot
Stable Theories in Autoepistemic Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/11591191_44openalex-snapshot
The Relationship Between Reasoning About Privacy and Default Logics
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_9openalex-snapshot
On the Relationship between Defeasible Logic and Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/3-540-58107-3_11openalex-snapshot
Weak autoepistemic reasoning and well-founded semantics
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_26openalex-snapshot
Stable classes and operator pairs for disjunctive programs
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_14openalex-snapshot
Computing non-ground representations of stable models
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_22openalex-snapshot
Dempster-Shafer Logic Programs and Stable Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-61581-3_40openalex-snapshot
The Complexity of Inferences and Explanations in Probabilistic Logic Programming
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-32275-7_34openalex-snapshot
Nonmonotonic Description Logic Programs: Implementation and Experiments
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/978-3-540-74610-2_3openalex-snapshot
Answer Set Programming for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_33openalex-snapshot
Approved Models for Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-77684-0_14openalex-snapshot
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
inferred← citeshttps://doi.org/10.1007/978-3-642-23032-5_6openalex-snapshot
Rules and Logic Programming for the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-23580-1_28openalex-snapshot
Inline Evaluation of Hybrid Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_14openalex-snapshot
Privacy Preservation Using Multi-context Systems and Default Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_23openalex-snapshot
Oscillating Behavior of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-94-017-1652-9_24openalex-snapshot
Logic Programs with Context-Dependent Preferences
inferred← citeshttps://doi.org/10.1007/bf00881912openalex-snapshot
Autoepistemic logic of first order and its expressive power
inferred← citeshttps://doi.org/10.1007/bf01530784openalex-snapshot
Well-founded and stationary models of logic programs
inferred← citeshttps://doi.org/10.1007/bf01534455openalex-snapshot
The expressiveness of locally stratified programs
inferred← citeshttps://doi.org/10.1007/bf01536398openalex-snapshot
Complexity and undecidability results for logic programming
inferred← citeshttps://doi.org/10.1007/bfb0023437openalex-snapshot
Default theory for Well Founded Semantics with explicit negation
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0030661openalex-snapshot
Logic programming with assumption denial
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1007/s10472-012-9280-3openalex-snapshot
Tightly integrated probabilistic description logic programs for representing ontology mappings
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90012-7openalex-snapshot
A simple fixed point characterization of three-valued stable model semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00207-3openalex-snapshot
A non-ground realization of the stable and well-founded semantics
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90031-bopenalex-snapshot
The family of stable models
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00023-yopenalex-snapshot
On the equivalence of semantics for normal logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00148-4openalex-snapshot
Amalgamating knowledge bases, III: Algorithms, data structures and query processing
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.006openalex-snapshot
Grounded fixpoints and their applications in knowledge representation
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.011openalex-snapshot
Semi-equilibrium models for paracoherent answer set programs
inferred← citeshttps://doi.org/10.1016/j.ic.2004.02.004openalex-snapshot
Ultimate approximation and its application in nonmonotonic knowledge representation systems
inferred← citeshttps://doi.org/10.1016/j.jal.2004.07.007openalex-snapshot
Epistemology and artificial intelligence
inferred← citeshttps://doi.org/10.1016/j.jal.2004.07.012openalex-snapshot
An encompassing framework for Paraconsistent Logic Programs
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00201-2openalex-snapshot
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00171-0openalex-snapshot
Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
inferred← citeshttps://doi.org/10.1017/s1471068406002791openalex-snapshot
Logic programming with default, weak and strict negations
inferred← citeshttps://doi.org/10.1017/s147106841100041xopenalex-snapshot
Interdefinability of defeasible logic and logic programming under the well-founded semantics
inferred← citeshttps://doi.org/10.1023/a:1010527400940openalex-snapshot
Representing Meta-Knowledge in Poole-Systems
inferred← citeshttps://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1109/69.390244openalex-snapshot
WFS + branch and bound = stable models
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1109/tfuzz.2022.3189391openalex-snapshot
Fuzzy Multicontext Systems
inferred← citeshttps://doi.org/10.1109/tkde.2010.111openalex-snapshot
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
inferred← citeshttps://doi.org/10.1109/wi-iat.2010.44openalex-snapshot
F-Logic#: Loosely Coupling F-Logic Rules and Ontologies
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/2463664.2465229openalex-snapshot
Well-founded semantics for extended datalog and ontological reasoning
inferred← citeshttps://doi.org/10.1145/3366423.3380229openalex-snapshot
Stable Model Semantics for Recursive SHACL
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.13140/rg.2.1.2740.8484openalex-snapshot
Groundedness in logics with a fixpoint semantics
inferred← citeshttps://doi.org/10.14236/ewic/adbis1996.12openalex-snapshot
Disjunctive Rules and Null Values: Logic Programs with Incomplete Information
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8227openalex-snapshot
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
inferred← citeshttps://doi.org/10.1613/jair.5482openalex-snapshot
On the Semantics and Complexity of Probabilistic Logic Programs
inferred← citeshttps://doi.org/10.18926/15362openalex-snapshot
Abductive Proof Procedure with Adjusting Derivations for General Logic Programs
inferred← citeshttps://doi.org/10.21236/ada447975openalex-snapshot
SHOP and M-SHOP: Planning With Ordered Task Decomposition
inferred← citeshttps://doi.org/10.3139/120.110751openalex-snapshot
CPE: Novel method to shorten the lead time for laser micro-machining
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-35openalex-snapshot
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
inferred← citeshttps://doi.org/10.3233/fi-1999-40105openalex-snapshot
Computation of Extensions of Seminormal Default Theories
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.00869openalex-snapshot
An Answer Set Programming System with Cycle Breaking Heuristic
inferred← citeshttps://doi.org/10.4114/ia.v11i35.904openalex-snapshot
Relating DeLP and Default Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1701.09000openalex-snapshot
On the Semantics and Complexity of Probabilistic Logic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0005010openalex-snapshot
Extending and Implementing the Stable Model Semantics
inferred← citeshttps://doi.org/10.57709/1397210openalex-snapshot
A Novel Stable Model Computation Approach for General Dedcutive Databases
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.