On the public citation graph

Programming constraint inference engines

0 signed · 59 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-58601-6openalex-snapshot
Principles and Practice of Constraint Programming
inferredcites →https://doi.org/10.1007/3-540-61756-6_108openalex-snapshot
Oz Explorer: A visual constraint programming tool
inferredcites →https://doi.org/10.1007/978-3-642-78545-0_3openalex-snapshot
Object-Oriented Concurrent Constraint Programming in Oz
inferredcites →https://doi.org/10.1007/bfb0105407openalex-snapshot
Stålmarck’s algorithm as a HOL derived rule
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0743-1066(95)00121-2openalex-snapshot
Compiling constraints in clp(FD)
inferredcites →https://doi.org/10.1016/s0898-1221(98)90677-0openalex-snapshot
Logic programming: Proceedings of the fourteenth international conference on logic programming
inferredcites →https://doi.org/10.1016/s0898-1221(98)90679-4openalex-snapshot
Logic programming: Proceedings of the 1997 international symposium
inferredcites →https://doi.org/10.1109/tai.1995openalex-snapshot
Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence
inferredcites →https://doi.org/10.1109/tai.1996.560445openalex-snapshot
Oz Scheduler: a workbench for scheduling problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-22827-6_3openalex-snapshot
Constraint Languages for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/10722311_9openalex-snapshot
Towards a Language for CLP Choice-Tree Visualisation
inferred← citeshttps://doi.org/10.1007/11493853_28openalex-snapshot
Nondeterministic Control for Hybrid Search
inferred← citeshttps://doi.org/10.1007/11889205_27openalex-snapshot
High-Level Nondeterministic Abstractions in C++
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_3openalex-snapshot
Constraint (Logic) Programming: A Survey on Research and Applications
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_29openalex-snapshot
Promoting Constraints to First-Class Status
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_82openalex-snapshot
Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_17openalex-snapshot
Components for State Restoration in Tree Search
inferred← citeshttps://doi.org/10.1007/3-540-45945-6openalex-snapshot
Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_13openalex-snapshot
A Toolkit for Constraint-Based Inference Engines
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_15openalex-snapshot
Programming Deep Concurrent Constraint Combinators
inferred← citeshttps://doi.org/10.1007/978-3-030-39197-3_1openalex-snapshot
Interactive Text Graph Mining with a Prolog-based Dialog Engine
inferred← citeshttps://doi.org/10.1007/978-3-540-45157-0_16openalex-snapshot
Search Strategy for Constraint-Based Class–Teacher Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_37openalex-snapshot
Parallelizing Constraint Programs Transparently
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_58openalex-snapshot
Search Combinators
inferred← citeshttps://doi.org/10.1007/bf03037481openalex-snapshot
Programming languages for distributed applications
inferred← citeshttps://doi.org/10.1007/bfb0053559openalex-snapshot
Concurrent constraint programming based on functional programming
inferred← citeshttps://doi.org/10.1007/bfb0056627openalex-snapshot
Controlling search in declarative programs
inferred← citeshttps://doi.org/10.1007/s10601-006-9005-5openalex-snapshot
Nondeterministic Control for Hybrid Search
inferred← citeshttps://doi.org/10.1007/s10601-012-9137-8openalex-snapshot
Search combinators
inferred← citeshttps://doi.org/10.1007/s10845-012-0705-yopenalex-snapshot
Using UML and OCL for representing multiobjective combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.parco.2005.03.004openalex-snapshot
Issues in parallel execution of non-monotonic reasoning systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80107-0openalex-snapshot
Figaro: Yet Another Constraint Programming Library
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80017-9openalex-snapshot
Constraints in Procedural and Concurrent Languages
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80018-0openalex-snapshot
Finite Domain Constraint Programming Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/cbo9780511615320openalex-snapshot
Principles of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s0956796809990086openalex-snapshot
Monadic constraint programming
inferred← citeshttps://doi.org/10.1017/s1471068401001363openalex-snapshot
CLAIRE: combining sets, search and rules to better express algorithms
inferred← citeshttps://doi.org/10.1017/s1471068403001741openalex-snapshot
Logic programming in the context of multiparadigm programming: the Oz experience
inferred← citeshttps://doi.org/10.1109/bibmw.2011.6112365openalex-snapshot
QColors: An algorithm for conservative viral quasispecies reconstruction from short and non-contiguous next generation sequencing reads
inferred← citeshttps://doi.org/10.1109/icphm.2011.6024331openalex-snapshot
Automated scheduling using Condition Based Maintenance
inferred← citeshttps://doi.org/10.1145/312009.312029openalex-snapshot
Announcing the Mozart programming system
inferred← citeshttps://doi.org/10.1145/319301.319347openalex-snapshot
Efficient logic variables for distributed computing
inferred← citeshttps://doi.org/10.1145/359496.359529openalex-snapshot
Search and strategies in OPL
inferred← citeshttps://doi.org/10.1145/778348.778361openalex-snapshot
Comet in context
inferred← citeshttps://doi.org/10.1145/976706.976714openalex-snapshot
A decomposition-based implementation of search strategies
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0076openalex-snapshot
A Modeling Layer for Constraint-Programming Libraries
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0313openalex-snapshot
Transparent Parallelization of Constraint Programming
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.345.2826openalex-snapshot
Constraint and Integer Programming in OPL
inferred← citeshttps://doi.org/10.22028/d291-25719openalex-snapshot
Constraint propagation in Mozart
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.22028/d291-25770openalex-snapshot
Statistical A-star dependency parsing
inferred← citeshttps://doi.org/10.22028/d291-25781openalex-snapshot
Domain-independent local search for linear integer optimization
inferred← citeshttps://doi.org/10.3233/fi-1998-34304openalex-snapshot
A Proof Theoretic View of Constraint Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0405091openalex-snapshot
CLAIRE: Combining Sets, Search And Rules To Better Express Algorithms
inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0026openalex-snapshot
Extending a Concurrent Constraint Language by Propagators
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0025openalex-snapshot
CLAIRE: Combining Sets, Search and Rules to Better Express Algorithms
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0027openalex-snapshot
Comparing Trailing and Copying for 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.