On the public citation graph
On the declarative and procedural semantics of logic programs
0 signed · 150 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-16492-8_78openalex-snapshot
Some issues and trends in the semantics of logic programming
inferredcites →https://doi.org/10.1007/978-1-4612-5196-5_8openalex-snapshot
Towards a Logical Reconstruction of Relational Database Theory
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-96826-6openalex-snapshot
Foundations of Logic Programming
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(85)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot
Applications of circumscription to formalizing common-sense knowledge
inferredcites →https://doi.org/10.1016/0004-3702(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferredcites →https://doi.org/10.1016/0304-3975(85)90128-8openalex-snapshot
Optimal fixedpoints of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(84)90011-6openalex-snapshot
Making prolog more expressive
inferredcites →https://doi.org/10.1016/0743-1066(84)90023-2openalex-snapshot
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot
A basis for deductive database systems II
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(88)90006-4openalex-snapshot
Perspectives in deductive databases
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50008-7openalex-snapshot
On the Declarative Semantics of Logic Programs with Negation
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1111/j.1467-8640.1985.tb00055.xopenalex-snapshot
On the adequacy of predicate circumscription for closed‐world reasoning
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/6012.15409openalex-snapshot
Positivism vs minimalism in deductive databases
inferredcites →https://doi.org/10.1145/6012.15410openalex-snapshot
The extended closed world assumption and its relationship to parallel circumscription
inferredcites →https://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferredcites →https://doi.org/10.14288/1.0051930openalex-snapshot
Reasoning with incomplete information : investigations of non-monotonic reasoning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10704567_18openalex-snapshot
An Operational Semantics of Starlog
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
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/3-540-44957-4_41openalex-snapshot
Perfect Model Checking via Unfold/Fold Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_12openalex-snapshot
Program Derivation = Rules + Strategies
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-50701-9_21openalex-snapshot
Compiling circumscriptive theories into logic programs
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_55openalex-snapshot
The semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_25openalex-snapshot
A database needs two kinds of negation
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_151openalex-snapshot
Fully declarative logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_15openalex-snapshot
Model theoretic semantics for Demo
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_4openalex-snapshot
Conditional narrowing with constructive negation
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_17openalex-snapshot
Gentzen-style characterizations of Negation as Failure
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_23openalex-snapshot
On intuitionistic query answering in description bases
inferred← citeshttps://doi.org/10.1007/3-540-59286-5_53openalex-snapshot
Learning non-monotonic logic programs: Learning exceptions
inferred← citeshttps://doi.org/10.1007/3-540-61291-2_41openalex-snapshot
Reasoning about unknown, counterfactual, and nondeterministic actions in first-order logic
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_82openalex-snapshot
Logic program specialisation: How to be more specific
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_1openalex-snapshot
Program Equivalence, Program Development and Integrity Checking
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_20openalex-snapshot
Logics for Negation as Failure
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_6openalex-snapshot
Combining Event Calculus and Description Logic Reasoning via Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_11openalex-snapshot
Layerings of Logic Programs - Layer Decomposable Semantics and Incremental Model Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_11openalex-snapshot
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_11openalex-snapshot
Limiting Resolution: From Foundations to Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_1openalex-snapshot
Foundations of Rule-Based Query Answering
inferred← citeshttps://doi.org/10.1007/978-3-642-04329-1_7openalex-snapshot
Reasoning in Semantic Web-based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04581-3_1openalex-snapshot
Hybrid Reasoning with Rules and Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-642-15543-7_2openalex-snapshot
Hybrid Reasoning with Non-monotonic Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-19193-0_8openalex-snapshot
The Web Service Modeling Language
inferred← citeshttps://doi.org/10.1007/978-3-642-20551-4_8openalex-snapshot
On Inductive Proofs by Extended Unfold/Fold Transformation Rules
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-29414-3_3openalex-snapshot
Teleo-Reactive Abductive Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_14openalex-snapshot
Proving Properties of Co-Logic Programs by Unfold/Fold Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_14openalex-snapshot
Proving Properties of Co-logic Programs with Negation by Program Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_41openalex-snapshot
Concrete Results on Abstract Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/978-3-7643-8575-0_3openalex-snapshot
Semantic Web Service Description
inferred← citeshttps://doi.org/10.1007/978-94-011-7108-3_30openalex-snapshot
Semantic Trees for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferred← citeshttps://doi.org/10.1007/bf01185404openalex-snapshot
What is failure? An approach to constructive negation
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530761openalex-snapshot
Propositional semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf01530784openalex-snapshot
Well-founded and stationary models of logic programs
inferred← citeshttps://doi.org/10.1007/bf03037172openalex-snapshot
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
inferred← citeshttps://doi.org/10.1007/bf03037483openalex-snapshot
Constrained partial deduction and the preservation of characteristic trees
inferred← citeshttps://doi.org/10.1007/bf03037499openalex-snapshot
Predicate abstractions in higher-order logic programming
inferred← citeshttps://doi.org/10.1007/bfb0023315openalex-snapshot
Cumulativity and rationality in semantics of normal logic programs
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0030386openalex-snapshot
A tutorial on Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/s10115-010-0300-5openalex-snapshot
Hybrid rules with well-founded semantics
inferred← citeshttps://doi.org/10.1007/s10817-008-9106-5openalex-snapshot
Computing Only Minimal Answers in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1016/0004-3702(91)90013-aopenalex-snapshot
Three-valued nonmonotonic formalisms and semantics of logic programs
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90019-topenalex-snapshot
A logic of knowledge and justified assumptions
inferred← citeshttps://doi.org/10.1016/0169-023x(91)90038-yopenalex-snapshot
Handling indefinite and negative data in a deductive database
inferred← citeshttps://doi.org/10.1016/0304-3975(51)90005-9openalex-snapshot
The semantics of incomplete databases as an expression of preferences
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90106-0openalex-snapshot
A sound and complete semantics for a version of negation as failure
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90005-mopenalex-snapshot
Acyclic logic programs and the completeness of SLDNF-resolution
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90039-iopenalex-snapshot
Complete extension of general logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00109-3openalex-snapshot
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90019-yopenalex-snapshot
A procedural semantics for well-founded negation in logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90017-bopenalex-snapshot
Loop checking and negation
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90022-9openalex-snapshot
Loop checking in partial deduction
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90034-eopenalex-snapshot
A goal-oriented approach to computing the well-founded semantics
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
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/0890-5401(91)90073-bopenalex-snapshot
General logical databases and programs: Default logic semantics and stratification
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103726openalex-snapshot
Modular materialisation of Datalog programs
inferred← citeshttps://doi.org/10.1016/j.ijar.2015.06.009openalex-snapshot
Semantic-based construction of arguments: An answer set programming approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.040openalex-snapshot
Abstract interpretation of resolution-based semantics
inferred← citeshttps://doi.org/10.1016/j.websem.2022.100721openalex-snapshot
Satisfiability and containment of recursive SHACL
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00058-1openalex-snapshot
A note on the stable model semantics for logic programs
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00087-9openalex-snapshot
Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80053-4openalex-snapshot
A three-valued semantics for deductive databases and logic programs
inferred← citeshttps://doi.org/10.1016/s0169-023x(01)00023-4openalex-snapshot
Constructing interpretations of deductive databases using reduction and dynamic stratification
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00026-8openalex-snapshot
Top-down query processing in indefinite stratified databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(99)00015-4openalex-snapshot
On cyclic covers and perfect models
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10027-4openalex-snapshot
Constructive negation under the well-founded semantics
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00075-8openalex-snapshot
ACLP: Abductive Constraint Logic Programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80047-7openalex-snapshot
On the Coincidence of Semantics for Uniquely Determined Programs
inferred← citeshttps://doi.org/10.1017/s0269888900005129openalex-snapshot
Deductive database theories
inferred← citeshttps://doi.org/10.1017/s0960129500001419openalex-snapshot
Unfold/fold transformations of logic programs
inferred← citeshttps://doi.org/10.1017/s147106840100103xopenalex-snapshot
Transformation-based bottom-up computation of the well-founded model
inferred← citeshttps://doi.org/10.1017/s1471068405002577openalex-snapshot
Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
inferred← citeshttps://doi.org/10.1017/s1471068425100239openalex-snapshot
On Systematic Construction of Correct Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1018965418898openalex-snapshot
A procedural semantics for stratified database updates
inferred← citeshttps://doi.org/10.1023/a:1020116927466openalex-snapshot
SLT-Resolution for the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1093/jigpal/12.5.371openalex-snapshot
A Hybrid Abductive Inductive Proof Procedure
inferred← citeshttps://doi.org/10.1109/69.617052openalex-snapshot
Programming with logical queries, bulk updates, and hypothetical reasoning
inferred← citeshttps://doi.org/10.1109/dexa.1996.558340openalex-snapshot
An approach to multiparadigm programming database systems
inferred← citeshttps://doi.org/10.1109/icci.1992.227704openalex-snapshot
What is failure? or: constructive negation by fail answers
inferred← citeshttps://doi.org/10.1109/risp.1992.213272openalex-snapshot
Authorization in distributed systems: a formal approach
inferred← citeshttps://doi.org/10.1109/seep.1996.533984openalex-snapshot
A front-end to deductive database systems for multiparadigm programming
inferred← citeshttps://doi.org/10.1145/113413.113432openalex-snapshot
On negation in HiLog (extended abstract)
inferred← citeshttps://doi.org/10.1145/115790.115817openalex-snapshot
A non-deterministic deductive database language
inferred← citeshttps://doi.org/10.1145/153850.153865openalex-snapshot
Query evaluation under the well-founded semantics
inferred← citeshttps://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferred← citeshttps://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferred← citeshttps://doi.org/10.1145/73721.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferred← citeshttps://doi.org/10.1145/93597.93621openalex-snapshot
IDLOG: extending the expressive power of deductive database languages
inferred← citeshttps://doi.org/10.1145/93605.93621openalex-snapshot
IDLOG: extending the expressive power of deductive database languages
inferred← citeshttps://doi.org/10.13025/21329openalex-snapshot
The WSML Rule Languages for the Semantic Web
inferred← citeshttps://doi.org/10.20868/upm.thesis.37873openalex-snapshot
Extending the expressiveness of fuzzy logic languages
inferred← citeshttps://doi.org/10.3233/fi-1994-201236openalex-snapshot
SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
inferred← citeshttps://doi.org/10.3233/fun-2002-49404openalex-snapshot
Processing Indefinite Deductive Databases under the Possible Model Semantics
inferred← citeshttps://doi.org/10.3233/jcs-1993-22-304openalex-snapshot
Authorization in Distributed Systems: A New Approach1
inferred← citeshttps://doi.org/10.3233/ssw200045openalex-snapshot
Large-Scale Ontological Reasoning via Datalog
inferred← citeshttps://doi.org/10.4204/eptcs.306.28openalex-snapshot
Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0003056openalex-snapshot
A note on the Declarative reading(s) of Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0011013openalex-snapshot
Transformation-Based Bottom-Up Computation of the Well-Founded Model
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0305007openalex-snapshot
Computing only minimal answers in disjunctive deductive databases
inferred← citeshttps://doi.org/10.4995/thesis/10251/5760openalex-snapshot
Generación de reglas restauradoras de la consistencia en esquemas relacionales con vistas.
inferred← citeshttps://doi.org/10.7551/mitpress/4307.003.0033openalex-snapshot
Reasoning in Open Domains
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.