On the public citation graph

The expressive powers of the logic programming semantics (extended abstract)

https://doi.org/10.1145/298514.298564
0 signed · 68 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/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
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(85)90018-4openalex-snapshot
Negation as failure. 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(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.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/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1017/s0022481200051604openalex-snapshot
An introduction to recursively saturated and resplendent models
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/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/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.1145/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
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.1145/73721.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferredcites →https://doi.org/10.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.2307/2272817openalex-snapshot
Toward model theory through recursive saturation
inferredcites →https://doi.org/10.3233/fi-1990-13105openalex-snapshot
Some Remarks on the Completed Database1

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w6924openalex-snapshot
Logic Programming
inferred← citeshttps://doi.org/10.1006/jcss.1997.1446openalex-snapshot
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
inferred← citeshttps://doi.org/10.1006/jcss.1997.1451openalex-snapshot
Tie-Breaking Semantics and Structural Totality
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-45628-7_21openalex-snapshot
Multiagent Compromises, Joint Fixpoints, and Stable Models
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_45openalex-snapshot
Some results on the complexity of SLD-derivations
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_5openalex-snapshot
Expressive power and complexity of disjunctive datalog under the stable model semantics
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_27openalex-snapshot
Dterministic and non-deterministic stable model semantics for unbound DATALOG queries
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_7openalex-snapshot
Querying disjunctive databases through nonmonotonic logics
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_8openalex-snapshot
DATALOG queries with stratified negation and choice: from P to D P
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_1openalex-snapshot
Complexity results for abductive logic programming
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_9openalex-snapshot
Computing the well-founded semantics faster
inferred← citeshttps://doi.org/10.1007/3-540-60608-4_34openalex-snapshot
Active database rules with transaction-conscious stable-model semantics
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_42openalex-snapshot
Generalized implicit definitions on finite structures
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_237openalex-snapshot
The expressive power of unique total stable model semantics
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_7openalex-snapshot
Affordable classes of normal logic programs
inferred← citeshttps://doi.org/10.1007/3-540-63792-3_24openalex-snapshot
Deterministic semantics for datalog ⌝: complexity and expressive power
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_21openalex-snapshot
Magic Sets and Their Application to Data Integration
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_10openalex-snapshot
Disjunctive Logic Programming over Finite Structures
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/bf00881911openalex-snapshot
Autoepistemic logic programming
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/bf01536403openalex-snapshot
How expressive is stratified aggregation?
inferred← citeshttps://doi.org/10.1007/bf02127971openalex-snapshot
Polynomial-time computable stable models
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/bf03037371openalex-snapshot
Functional queries in Datalog
inferred← citeshttps://doi.org/10.1007/bfb0027777openalex-snapshot
The expressive power of “possible-is-certain” semantics
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0054789openalex-snapshot
Datalog with nested rules
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90030-kopenalex-snapshot
Commonsense axiomatizations for logic programs
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.1023/a:1018986207453openalex-snapshot
Semantics and expressiveness of disjunctive ordered logic
inferred← citeshttps://doi.org/10.1023/a:1018999404360openalex-snapshot
Programming with non-determinism in deductive databases
inferred← citeshttps://doi.org/10.1109/69.542027openalex-snapshot
Computation of stable models and its integration with logical query processing
inferred← citeshttps://doi.org/10.1109/69.599933openalex-snapshot
Default logic as a query language
inferred← citeshttps://doi.org/10.1109/69.761663openalex-snapshot
Dynamic programming in Datalog with aggregates
inferred← citeshttps://doi.org/10.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferred← citeshttps://doi.org/10.1145/182591.182639openalex-snapshot
Adding disjunction to datalog (extended abstract)
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
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.