On the public citation graph
Incremental search in Constraint Logic Programming
0 signed · 34 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-18024-9_29openalex-snapshot
A framework for interactive problem solving based on interactive query revision
inferredcites →https://doi.org/10.1007/978-1-4471-3156-4_27openalex-snapshot
Constraint Logic Programming Language CAL
inferredcites →https://doi.org/10.1007/bf03037408openalex-snapshot
Spreadsheets with Incremental Queries as a user interface for logic programming
inferredcites →https://doi.org/10.1007/bf03037415openalex-snapshot
A method for efficiently executing horn clause programs using multiple processors
inferredcites →https://doi.org/10.1016/0004-3702(87)90091-9openalex-snapshot
Constraint propagation with interval labels
inferredcites →https://doi.org/10.1145/3341.3350openalex-snapshot
A generalized implicit enumeration algorithm for graph coloring
inferredcites →https://doi.org/10.7551/mitpress/3220.001.0001openalex-snapshot
Generating Language-Based Environments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_8openalex-snapshot
Compositional analysis for equational Horn programs
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_39openalex-snapshot
Model-based computing: Using concurrent constraint programming for modeling and model compilation
inferred← citeshttps://doi.org/10.1007/3-540-61479-6_16openalex-snapshot
A brief overview of over-constrained systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68194-6_14openalex-snapshot
Optimale Lösungen von CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-00675-3_2openalex-snapshot
Linear Weighted-Task-Sum – Scheduling Prioritized Tasks on a Single Resource
inferred← citeshttps://doi.org/10.1007/s10107-004-0518-7openalex-snapshot
Exploring relaxation induced neighborhoods to improve MIP solutions
inferred← citeshttps://doi.org/10.1007/s10601-005-2239-9openalex-snapshot
Constraint Solving in Uncertain and Dynamic Environments: A Survey
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00043-6openalex-snapshot
A compositional semantic basis for the analysis of equational Horn programs
inferred← citeshttps://doi.org/10.1016/j.ecoinf.2022.101607openalex-snapshot
Resolution methods for constraint satisfaction problem in remote sensing field: A survey of static and dynamic algorithms
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00020-1openalex-snapshot
Fuzzy rrDFCSP and planning
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00066-1openalex-snapshot
Model-based computing: Developing flexible machine control software
inferred← citeshttps://doi.org/10.1016/s0096-0551(99)00013-2openalex-snapshot
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s0269888999003070openalex-snapshot
Hard, flexible and dynamic constraint satisfaction
inferred← citeshttps://doi.org/10.1017/s1471068417000126openalex-snapshot
Contractibility for open global constraints
inferred← citeshttps://doi.org/10.1080/095281398146969openalex-snapshot
Solving hierarchies of finite-domain constraints
inferred← citeshttps://doi.org/10.1109/ncca.2011.30openalex-snapshot
Cross-layer SLA Selection for Cloud Services
inferred← citeshttps://doi.org/10.1109/tai.1993.633935openalex-snapshot
Nogood Recording for static and dynamic constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/tai.1994.346437openalex-snapshot
Distributed simulated re-annealing for dynamic constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/331119.331211openalex-snapshot
Incremental querying in the concurrent CLP language IFD-Constraint Pandora
inferred← citeshttps://doi.org/10.1145/976706.976714openalex-snapshot
A decomposition-based implementation of search strategies
inferred← citeshttps://doi.org/10.1527/tjsai.20.25openalex-snapshot
Nurse Scheduling System based on Dynamic Weighted Maximal Constraint Satisfaction Problem-Solution Stability based on the Provisional Constraint-
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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.