On the public citation graph
Computational complexity and constraint logic programming languages
0 signed · 37 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-1-4612-0441-1_8openalex-snapshot
Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0030287openalex-snapshot
Complexity of quantifier elimination in the theory of algebraically closed fields
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0743-1066(84)90021-9openalex-snapshot
Alternation and the computational complexity of logic programs
inferredcites →https://doi.org/10.1016/s0747-7171(89)80063-xopenalex-snapshot
CAL: A theoretical background of constraint logic programming and its applications
inferredcites →https://doi.org/10.1090/pspum/028.2/0432534openalex-snapshot
Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solution
inferredcites →https://doi.org/10.1109/lics.1990.113736openalex-snapshot
A theory of nonmonotonic rule systems
inferredcites →https://doi.org/10.1109/sfcs.1988.21945openalex-snapshot
A faster PSPACE algorithm for deciding the existential theory of the reals
inferredcites →https://doi.org/10.1145/298514.298582openalex-snapshot
Constraint query languages (preliminary report)
inferredcites →https://doi.org/10.1145/62212.62257openalex-snapshot
Some algebraic and geometric computations in PSPACE
inferredcites →https://doi.org/10.1145/73007.73020openalex-snapshot
Quantifier elimination in the theory of an algebraically-closed field
inferredcites →https://doi.org/10.1145/800076.802488openalex-snapshot
Embedded implicational dependencies and their inference problem
inferredcites →https://doi.org/10.1287/moor.12.1.50openalex-snapshot
Hermite Normal Form Computation Using Modulo Determinant Arithmetic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1099-1174.1994.tb00059.xopenalex-snapshot
Integrating Logical Inference with Numeric Optimization
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_57openalex-snapshot
From LP to LP: Programming with constraints
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_92openalex-snapshot
Constraint programming and database query languages
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_7openalex-snapshot
Declarative Data Analysis Using Limit Datalog Programs
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1016/0167-9236(96)00033-4openalex-snapshot
Anticipatory Pruning Networks and forward checking in CLP over continuous domains
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50131-7openalex-snapshot
Complexity Results for First-Order Theories of Temporal Constraints
inferred← citeshttps://doi.org/10.1016/s0360-8352(97)00221-0openalex-snapshot
Modern modeling of a classic multiperiod problem
inferred← citeshttps://doi.org/10.1017/s0269888900005798openalex-snapshot
Constraint logic programming
inferred← citeshttps://doi.org/10.1017/s1471068412000294openalex-snapshot
Relative expressiveness of defeasible logics
inferred← citeshttps://doi.org/10.1017/s1471068413000367openalex-snapshot
Relative expressiveness of defeasible logics II
inferred← citeshttps://doi.org/10.1023/a:1018979717390openalex-snapshot
Logic, modeling, and programming
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470527openalex-snapshot
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1145/190616.190619openalex-snapshot
Database querying and constraint programming
inferred← citeshttps://doi.org/10.1145/212433.212447openalex-snapshot
Constraint programming and database languages
inferred← citeshttps://doi.org/10.1145/3495009openalex-snapshot
The Complexity and Expressive Power of Limit Datalog
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07209openalex-snapshot
Bernays-Schoenfinkel-Ramsey with Simple Bounds is NEXPTIME-complete
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.