On the public citation graph

Non-linear real constraints in constraint logic programming

https://doi.org/10.1007/bfb0013827
0 signed · 31 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/3-540-15984-3_235openalex-snapshot
The SAC-2 computer algebra system
inferredcites →https://doi.org/10.1007/978-1-4471-3156-4_27openalex-snapshot
Constraint Logic Programming Language CAL
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/978-94-009-7960-4_2openalex-snapshot
Parts I and II
inferredcites →https://doi.org/10.1007/bf00245462openalex-snapshot
CLP(?) and some electrical engineering problems
inferredcites →https://doi.org/10.1007/bf01386381openalex-snapshot
The evaluation of the zeros of ill-conditioned polynomials. Part I
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(08)80152-6openalex-snapshot
Partial Cylindrical Algebraic Decomposition for quantifier elimination
inferredcites →https://doi.org/10.1016/s0747-7171(88)80016-6openalex-snapshot
A bibliography of quantifier elimination for real closed fields
inferredcites →https://doi.org/10.1093/comjnl/36.5.432openalex-snapshot
Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/1093390.1093395openalex-snapshot
The algorithm description language ALDES (report)
inferredcites →https://doi.org/10.1145/143242.143306openalex-snapshot
Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/79204.79210openalex-snapshot
An introduction to Prolog III
inferredcites →https://doi.org/10.1145/96877.96943openalex-snapshot
An improvement of the projection operator in cylindrical algebraic decomposition
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722311_12openalex-snapshot
Debugging Constraint Programs by Store Inspection
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_32openalex-snapshot
RISC-CLP(CF) constraint logic programming over complex functions
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_17openalex-snapshot
CLP(x) for Proving Program Properties
inferred← citeshttps://doi.org/10.1007/bf03038312openalex-snapshot
Compile-time analysis of nonlinear constraints in CLPR
inferred← citeshttps://doi.org/10.1007/bfb0013181openalex-snapshot
Extending RISC-CLP(Real) to handle symbolic functions
inferred← citeshttps://doi.org/10.1007/bfb0013814openalex-snapshot
Algebraic and Logic Programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10004-3openalex-snapshot
CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10005-5openalex-snapshot
Theory and practice of constraint handling rules
inferred← citeshttps://doi.org/10.1023/a:1014754106275openalex-snapshot
Efficient Interval Linear Equality Solving in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1109/ase.1999.802142openalex-snapshot
A visualization tool for constraint program debugging
inferred← citeshttps://doi.org/10.1109/tai.1994.346505openalex-snapshot
A WAM-based abstract machine for interval constraint logic programming
inferred← citeshttps://doi.org/10.1145/164081.164140openalex-snapshot
Quantifier elimination for formulas constrained by quadratic equations
inferred← citeshttps://doi.org/10.1145/331119.331147openalex-snapshot
Implementing non-linear constraints with cooperative solvers
inferred← citeshttps://doi.org/10.1145/384101.384123openalex-snapshot
Symbolic-interval cooperation in constraint 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.