On the public citation graph
Logic programming and reasoning with incomplete information
0 signed · 125 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-54009-1_25openalex-snapshot
A database needs two kinds of negation
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/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/978-3-642-76274-1_4openalex-snapshot
On Asking What a Database Knows
inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
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(80)90016-8openalex-snapshot
Addendum: Circumscription and other non-monotonic formalisms
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(86)90068-8openalex-snapshot
Making believers out of computers
inferredcites →https://doi.org/10.1016/0004-3702(90)90056-6openalex-snapshot
All I know: A study in autoepistemic logic
inferredcites →https://doi.org/10.1016/0743-1066(84)90011-6openalex-snapshot
Making prolog more expressive
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-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1145/6012.15410openalex-snapshot
The extended closed world assumption and its relationship to parallel circumscription
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_60openalex-snapshot
Answer sets and nonmonotonic S4
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_32openalex-snapshot
Representing null values in logic programming
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_27openalex-snapshot
Nonmonotonicity and answer set inference
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_28openalex-snapshot
Trans-epistemic semantics for logic programs
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_10openalex-snapshot
Strong and explicit negation in non-monotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_10openalex-snapshot
Logical Approaches to Incomplete Information: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_40openalex-snapshot
Epistemic Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-30244-3_44openalex-snapshot
An Argumentative Characterization of Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-35166-3_8openalex-snapshot
Strongly Equivalent Epistemic Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-85713-4_25openalex-snapshot
Modeling Administrative Discretion Using Goal-Directed Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_11openalex-snapshot
Epistemic Logic Programs: A Study of Some Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-35759-6_6openalex-snapshot
Probabilistic Autoepistemic Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-58202-8_16openalex-snapshot
Value Awareness and Process Automation: A Reflection Through School Place Allocation Models
inferred← citeshttps://doi.org/10.1007/978-3-031-74209-5_30openalex-snapshot
A Generalisation of Epistemic Splitting Property
inferred← citeshttps://doi.org/10.1007/978-3-032-37438-7_52openalex-snapshot
Towards a Unified Framework for Debugging Systems Requirements Specifications Translated Into ASP Logic Predicates
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_43openalex-snapshot
Logic Programming with Graded Modality
inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_18openalex-snapshot
Answer Set Programming with Graded Modality
inferred← citeshttps://doi.org/10.1007/978-3-642-04595-0_9openalex-snapshot
A Knowledge Based Formal Language for Securing Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_4openalex-snapshot
Manifold Answer-Set Programs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_29openalex-snapshot
New Semantics for Epistemic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_3openalex-snapshot
Answer Set Modules for Logical Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-35101-3_48openalex-snapshot
RDL: Enhancing Description Logic with Rules
inferred← citeshttps://doi.org/10.1007/978-94-015-9309-0_8openalex-snapshot
From Here to There: Stable Negation in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-017-1317-7_3openalex-snapshot
Reasoning about Actual and Hypothetical Occurrences of Concurrent and Non-Deterministic Actions
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bfb0023801openalex-snapshot
A new logical characterisation of stable models and answer sets
inferred← citeshttps://doi.org/10.1007/bfb0030659openalex-snapshot
Samantics of normal and disjunctive logic programs a unifying framework
inferred← citeshttps://doi.org/10.1007/bfb0095091openalex-snapshot
A class of stratified programs in autoepistemic logic of knowledge and belief
inferred← citeshttps://doi.org/10.1007/s10472-019-09621-1openalex-snapshot
A parallel memory-efficient epistemic logic program solver: harder, better, faster
inferred← citeshttps://doi.org/10.1007/s10506-023-09376-5openalex-snapshot
Automated legal reasoning with discretion to act using s(LAW)
inferred← citeshttps://doi.org/10.1007/s11704-016-5158-6openalex-snapshot
Reasoning about actions with loops via Hoare logic
inferred← citeshttps://doi.org/10.1007/s11787-025-00402-5openalex-snapshot
Splitting Property for Epistemic Equilibrium Logics
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90028-fopenalex-snapshot
An overview of nonmonotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90035-fopenalex-snapshot
Representing action and change by logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00022-xopenalex-snapshot
Autoepistemic logics as a unifying framework for the semantics of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00151-4openalex-snapshot
Extending Prolog with nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.004openalex-snapshot
Evaluating epistemic negation in answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.005openalex-snapshot
Querying incomplete information in RDF with SPARQL
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103249openalex-snapshot
Autoepistemic equilibrium logic and epistemic specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103382openalex-snapshot
Autoepistemic answer set programming
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot
Autoepistemic logic of knowledge and beliefs
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00140-9openalex-snapshot
Reasoning about effects of concurrent actions
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1017/s1471068403001674openalex-snapshot
Defeasible logic programming: an argumentative approach
inferred← citeshttps://doi.org/10.1017/s1471068419000218openalex-snapshot
On Uniform Equivalence of Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068420000022openalex-snapshot
selp: A Single-Shot Epistemic Logic Program Solver
inferred← citeshttps://doi.org/10.1017/s1471068420000228openalex-snapshot
eclingo : A Solver for Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1017/s147106842100048xopenalex-snapshot
Thirty years of Epistemic Specifications
inferred← citeshttps://doi.org/10.1017/s1471068424000012openalex-snapshot
Epistemic Logic Programs: A Study of Some Properties
inferred← citeshttps://doi.org/10.1017/s1471068425100070openalex-snapshot
Argumentative Characterizations of (Extended) Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1005900924623openalex-snapshot
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1018951805211openalex-snapshot
Logic knowledge bases with two default rules
inferred← citeshttps://doi.org/10.1093/logcom/exn100openalex-snapshot
Updating Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1093/logcom/exv065openalex-snapshot
The language of epistemic specifications (refined) including a prototype solver
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.1109/icicisys.2009.5357848openalex-snapshot
A modal logic for authorization specification and reasoning
inferred← citeshttps://doi.org/10.1109/wi.2005.115openalex-snapshot
Personalized Web Recommendations: Supporting Epistemic Information about End-Users
inferred← citeshttps://doi.org/10.1111/j.1468-0394.2006.00415.xopenalex-snapshot
A different paradigm for expert systems: an introduction to logic programming and related knowledge representation issues
inferred← citeshttps://doi.org/10.1145/3605098.3636022openalex-snapshot
Towards value-awareness in administrative processes: an approach based on constraint answer set programming
inferred← citeshttps://doi.org/10.1145/3748522.3779755openalex-snapshot
Logic-based Languages For Solving Reversibility in Planning
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012809openalex-snapshot
Strong Equivalence for Epistemic Logic Programs Made Easy
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25773openalex-snapshot
Epistemic Disjunctive Datalog for Querying Knowledge Bases
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25778openalex-snapshot
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
inferred← citeshttps://doi.org/10.22029/jlupub-7003openalex-snapshot
Preferred answer sets for extended logic programs
inferred← citeshttps://doi.org/10.24963/ijcai.2017/176openalex-snapshot
On Computing World Views of Epistemic Logic Programs
inferred← citeshttps://doi.org/10.24963/ijcai.2017/30openalex-snapshot
A Novel Symbolic Approach to Verifying Epistemic Properties of Programs
inferred← citeshttps://doi.org/10.24963/ijcai.2017/722openalex-snapshot
Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/ijcai.2018/237openalex-snapshot
Single-Shot Epistemic Logic Program Solving
inferred← citeshttps://doi.org/10.24963/ijcai.2023/357openalex-snapshot
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs
inferred← citeshttps://doi.org/10.26348/znwwsi.11.41openalex-snapshot
A Knowledge Representation Framework Based on Epistemic Logic
inferred← citeshttps://doi.org/10.29007/sclqopenalex-snapshot
Epistemic Logic Programs with World View Constraints
inferred← citeshttps://doi.org/10.29007/xwzzopenalex-snapshot
A Survey of Advances in Epistemic Logic Program Solvers
inferred← citeshttps://doi.org/10.3233/fi-2016-1400openalex-snapshot
Logic Programming with Graded Introspection
inferred← citeshttps://doi.org/10.4018/978-1-4666-1580-9.ch013openalex-snapshot
A Formal Approach for Securing XML Document
inferred← citeshttps://doi.org/10.4018/978-1-4666-2482-5.ch008openalex-snapshot
Ell Secure Information System Using Modal Logic Technique
inferred← citeshttps://doi.org/10.4018/978-1-5225-2255-3.ch411openalex-snapshot
Logic Programming for Intelligent Systems
inferred← citeshttps://doi.org/10.4018/978-1-5225-7368-5.ch065openalex-snapshot
Logic Programming for Intelligent Systems
inferred← citeshttps://doi.org/10.4018/978-1-59140-556-6.ch073openalex-snapshot
Quality of Knowledge in Virtual Entities
inferred← citeshttps://doi.org/10.4018/jsse.2010102003openalex-snapshot
A Formal Approach for Securing XML Document
inferred← citeshttps://doi.org/10.4018/jsse.2011040104openalex-snapshot
Ell Secure Information System Using Modal Logic Technique
inferred← citeshttps://doi.org/10.4204/eptcs.306.11openalex-snapshot
Epistemic Logic Programs: A Different World View
inferred← citeshttps://doi.org/10.4204/eptcs.306.47openalex-snapshot
Proceedings 35th International Conference on Logic Programming (Technical Communications)
inferred← citeshttps://doi.org/10.4204/eptcs.345.25openalex-snapshot
Refining the Semantics of Epistemic Specifications
inferred← citeshttps://doi.org/10.4204/eptcs.416.18openalex-snapshot
Pearce's Characterisation in an Epistemic Domain
inferred← citeshttps://doi.org/10.48550/arxiv.1105.6148openalex-snapshot
Overcoming Misleads In Logic Programs by Redefining Negation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3486openalex-snapshot
ESmodels: An Epistemic Specification Solver
inferred← citeshttps://doi.org/10.48550/arxiv.1811.04800openalex-snapshot
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01089openalex-snapshot
selp: A Single-Shot Epistemic Logic Program Solver
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0003038openalex-snapshot
A Splitting Set Theorem for Epistemic Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404051openalex-snapshot
Knowledge And The Action Description Language A
inferred← citeshttps://doi.org/10.5555/2460416.2460424openalex-snapshot
A modal logic for information system security
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94634openalex-snapshot
The Role of preferences in logic programming: nonmonotonic reasoning, user preferences, decision under uncertainty
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.