On the public citation graph

Algorithms for Stochastic CSPs

0 signed · 28 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/978-1-4419-1642-6openalex-snapshot
Stochastic programming : the state of the art : in honor of George B. Dantzig
inferredcites →https://doi.org/10.1007/bf00132735openalex-snapshot
Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty
inferredcites →https://doi.org/10.1007/s10601-005-2239-9openalex-snapshot
Constraint Solving in Uncertain and Dynamic Environments: A Survey
inferredcites →https://doi.org/10.1016/j.artint.2005.02.004openalex-snapshot
An optimal coarse-grained arc consistency algorithm
inferredcites →https://doi.org/10.1016/s0927-0507(03)10001-1openalex-snapshot
Stochastic Programming Models
inferredcites →https://doi.org/10.1023/a:1017584715408openalex-snapshot
Stochastic Boolean Satisfiability
inferredcites →https://doi.org/10.48550/arxiv.0903.1152openalex-snapshot
Stochastic Constraint Programming
inferredcites →https://doi.org/10.48550/arxiv.0905.3763openalex-snapshot
Scenario-based Stochastic Constraint Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_7openalex-snapshot
A Survey on CP-AI-OR Hybrids for Decision Making Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_23openalex-snapshot
Scenario-Based Learning for Stochastic Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_20openalex-snapshot
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_16openalex-snapshot
Cost-Based Domain Filtering for Stochastic Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_36openalex-snapshot
Synthesizing Filtering Algorithms for Global Chance-Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_53openalex-snapshot
Evolving Parameterised Policies for Stochastic Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_44openalex-snapshot
Resolution for Stochastic Boolean Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_14openalex-snapshot
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/s10601-007-9038-4openalex-snapshot
A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints
inferred← citeshttps://doi.org/10.1007/s10601-009-9068-1openalex-snapshot
Non-binary quantified CSP: algorithms and modelling
inferred← citeshttps://doi.org/10.1007/s10601-014-9170-xopenalex-snapshot
Hybrid metaheuristics for stochastic constraint programming
inferred← citeshttps://doi.org/10.1007/s10601-015-9199-5openalex-snapshot
General game playing with stochastic CSP
inferred← citeshttps://doi.org/10.1007/s10601-018-9283-8openalex-snapshot
Modeling uncertainties with chance constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2011.03.004openalex-snapshot
Preferences in AI: An overview
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.001openalex-snapshot
Filtering algorithms for global chance constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2015.07.004openalex-snapshot
Confidence-based reasoning in stochastic constraint programming
inferred← citeshttps://doi.org/10.1109/qsic.2007.4385508openalex-snapshot
Uniform Selection of Feasible Paths as a Stochastic Constraint Problem
inferred← citeshttps://doi.org/10.1145/1244002.1244077openalex-snapshot
On the stochastic constraint satisfaction framework
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:16)2012openalex-snapshot
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability
inferred← citeshttps://doi.org/10.70675/f4e01b3dzb0c0z48cazb512z9fce896739e7openalex-snapshot
Une nouvelle approche au General Game Playing dirigée par les contraintes
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.