On the public citation graph

Complexity and undecidability results for logic programming

https://doi.org/10.1007/bf01536398
0 signed · 84 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.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf00881799openalex-snapshot
Dualities between alternative semantics for logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/bf01543479openalex-snapshot
Formalizing a logic for 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(80)90013-2openalex-snapshot
The mathematics of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(91)90033-2openalex-snapshot
Why not negation by fixpoint?
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/0168-0072(87)90062-5openalex-snapshot
Decidability and definability with circumscription
inferredcites →https://doi.org/10.1016/0168-0072(92)90069-copenalex-snapshot
How complicated is the set of stable models of a recursive logic program?
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
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/0743-1066(90)90026-2openalex-snapshot
A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
inferredcites →https://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferredcites →https://doi.org/10.1016/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified 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/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
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.1093/logcom/2.6.719openalex-snapshot
Abductive Logic Programming
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/137097.137103openalex-snapshot
Tie-breaking semantics and structural totality
inferredcites →https://doi.org/10.1145/298514.298564openalex-snapshot
The expressive powers of the logic programming semantics (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
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/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/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800076.802488openalex-snapshot
Embedded implicational dependencies and their inference problem
inferredcites →https://doi.org/10.3233/fi-1990-13103openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs
inferredcites →https://doi.org/10.3233/fi-1990-13105openalex-snapshot
Some Remarks on the Completed Database1
inferredcites →https://doi.org/10.3233/fi-1994-2144openalex-snapshot
THE COMPLEXITY OF LOCAL STRATIFICATION
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470050118.ecse105openalex-snapshot
Deductive Databases
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-45632-5_5openalex-snapshot
Key Constraints and Monotonic Aggregates in Deductive Databases
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_40openalex-snapshot
Total and partial well-founded Datalog coincide
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_9openalex-snapshot
The Expressive Power of Revised Datalog on Problems with Closure Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-30024-5_13openalex-snapshot
Integrity Constraints for General-Purpose Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_11openalex-snapshot
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
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-94-017-1739-7_8openalex-snapshot
A Survey of Paraconsistent Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0031745openalex-snapshot
The expressive power of partial models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/pl00013306openalex-snapshot
Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$
inferred← citeshttps://doi.org/10.1007/s10472-018-9577-yopenalex-snapshot
Active integrity constraints for general-purpose knowledge bases
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00179-xopenalex-snapshot
Abduction from logic programs: Semantics and complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00108-4openalex-snapshot
Circumscribing datalog: Expressive power and complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00129-1openalex-snapshot
Expressive power and complexity of partial models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00027-7openalex-snapshot
Expressiveness of stable model semantics for disjunctive logic programs with functions
inferred← citeshttps://doi.org/10.1017/s1471068401001247openalex-snapshot
On properties of update sequences based on causal rejection
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/1055686.1055687openalex-snapshot
Induction from answer sets in nonmonotonic logic programs
inferred← citeshttps://doi.org/10.1145/1342991.1342998openalex-snapshot
A logic of nonmonotone inductive definitions
inferred← citeshttps://doi.org/10.1145/1380572.1380575openalex-snapshot
Open answer set programming with guarded programs
inferred← citeshttps://doi.org/10.1145/261124.261126openalex-snapshot
Disjunctive datalog
inferred← citeshttps://doi.org/10.1145/2629502openalex-snapshot
Rumpole
inferred← citeshttps://doi.org/10.1145/288627.288694openalex-snapshot
Providing semantics for indefinite deductive databases
inferred← citeshttps://doi.org/10.1145/383779.383789openalex-snapshot
Logic programming revisited
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1186/s13321-025-01092-3openalex-snapshot
Chemical classification program synthesis using generative artificial intelligence
inferred← citeshttps://doi.org/10.13140/rg.2.1.2740.8484openalex-snapshot
Groundedness in logics with a fixpoint semantics
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
inferred← citeshttps://doi.org/10.1613/jair.664openalex-snapshot
Space Efficiency of Propositional Knowledge Representation Formalisms
inferred← citeshttps://doi.org/10.3233/aic-2010-0474openalex-snapshot
Finite domain and symbolic inference methods for extensions of first-order logic
inferred← citeshttps://doi.org/10.3233/fi-2012-758openalex-snapshot
Synthesizing Concurrent Programs Using Answer Set Programming
inferred← citeshttps://doi.org/10.3233/fi-2017-1585openalex-snapshot
Representing Argumentation Frameworks in Answer Set Programming
inferred← citeshttps://doi.org/10.3745/kipstd.2002.9d.2.243openalex-snapshot
Inclusive and Exclusive or Interpretation for Indefinite Deductive Databases
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0501025openalex-snapshot
A Logic for Non-Monotone Inductive Definitions
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.