On the public citation graph
Automatically configuring constraint satisfaction programs: A case study
0 signed · 147 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-61291-2_40openalex-snapshot
Selecting the right heuristic algorithm: Runtime performance predictors
inferredcites →https://doi.org/10.1007/978-1-4613-1703-6openalex-snapshot
Learning Search Control Knowledge
inferredcites →https://doi.org/10.1007/978-3-662-12405-5_12openalex-snapshot
MACHINE TRANSFORMATION OF ADVICE INTO A HEURISTIC SEARCH PROCEDURE
inferredcites →https://doi.org/10.1007/bf00114116openalex-snapshot
Explanation-Based Learning: An Alternative View
inferredcites →https://doi.org/10.1007/bf00993983openalex-snapshot
Statistical Methods for Analyzing Speedup Learning Experiments
inferredcites →https://doi.org/10.1016/0004-3702(78)90029-2openalex-snapshot
A language and a program for stating and solving combinatorial problems
inferredcites →https://doi.org/10.1016/0004-3702(90)90059-9openalex-snapshot
Quantitative results concerning the utility of explanation-based learning
inferredcites →https://doi.org/10.1016/0004-3702(92)90007-kopenalex-snapshot
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90010-uopenalex-snapshot
Learning to improve constraint-based scheduling
inferredcites →https://doi.org/10.1016/0004-3702(92)90020-xopenalex-snapshot
A generic arc-consistency algorithm and its specializations
inferredcites →https://doi.org/10.1016/0004-3702(95)00046-1openalex-snapshot
Experimental results on the crossover point in random 3-SAT
inferredcites →https://doi.org/10.1016/0022-2496(83)90037-8openalex-snapshot
Machine learning: An artificial intelligence approach
inferredcites →https://doi.org/10.1016/0196-6774(88)90005-3openalex-snapshot
Almost all k-colorable graphs are easy to color
inferredcites →https://doi.org/10.1016/b978-0-08-049944-4.50035-5openalex-snapshot
Constraint Satisfaction with a Multi-Dimensional Domain
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50034-0openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.1016/b978-1-55860-200-7.50029-5openalex-snapshot
Learning Variable Descriptors for Applying Heuristics Across CSP Problems
inferredcites →https://doi.org/10.1016/b978-1-55860-200-7.50104-5openalex-snapshot
A Hybrid Approach to Guaranteed Effective Control Strategies
inferredcites →https://doi.org/10.1016/c2013-0-07691-8openalex-snapshot
The Handbook of Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferredcites →https://doi.org/10.1023/a:1022691120807openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.1109/kbse.1992.252912openalex-snapshot
Knowledge-based constraint-driven software synthesis
inferredcites →https://doi.org/10.1109/kbse.1993.341196openalex-snapshot
A knowledge based framework for developing and customizing schedulers
inferredcites →https://doi.org/10.1109/kbse.1993.341197openalex-snapshot
Transformational approach to transportation scheduling
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/6462.6502openalex-snapshot
Efficient algorithms for finding maximum matching in graphs
inferredcites →https://doi.org/10.5555/140370.140377openalex-snapshot
Algorithms for constraint-satisfaction problems
inferredcites →https://doi.org/10.7282/t3-9ek0-2s77openalex-snapshot
Abstraction via approximate symmetry
inferredcites →https://doi.org/10.7551/mitpress/3314.003.0016openalex-snapshot
Planning and Learning in PRODIGY: Overview of an Integrated Architecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11536406_19openalex-snapshot
Using CBR to Select Solution Strategies in Constraint Programming
inferred← citeshttps://doi.org/10.1007/11564751_54openalex-snapshot
Evolving Variable-Ordering Heuristics for Constrained Optimisation
inferred← citeshttps://doi.org/10.1007/11589990_142openalex-snapshot
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
inferred← citeshttps://doi.org/10.1007/11889205_17openalex-snapshot
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_19openalex-snapshot
A Meta-heuristic for Subset Problems
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_20openalex-snapshot
Towards Inferring Labelling Heuristics for CSP Application Domains
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_4openalex-snapshot
Collaborative Learning for Constraint Solving
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_5openalex-snapshot
An Empirical Evaluation of the Effectiveness of Local Search for Replanning
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_7openalex-snapshot
Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_13openalex-snapshot
Achievements and Prospects of Program Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_35openalex-snapshot
The Adaptive Constraint Engine
inferred← citeshttps://doi.org/10.1007/3-540-48443-4_21openalex-snapshot
Metaprogramming Domain Specific Metaprograms
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_2openalex-snapshot
np-spec: An Executable Specification Language for Solving All Problems in NP
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_19openalex-snapshot
A Network-Based Adaptive Evolutionary Algorithm for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-72069-8_3openalex-snapshot
A General Model for Automated Algorithm Design
inferred← citeshttps://doi.org/10.1007/978-3-030-99429-7openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-030-99429-7_3openalex-snapshot
Construction of Verifier Combinations Based on Off-the-Shelf Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-75577-4_1openalex-snapshot
Location, Size, and Capacity
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5openalex-snapshot
Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_10openalex-snapshot
Improving Cluster-Based Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_3openalex-snapshot
Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_4openalex-snapshot
Training Parameterized Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_5openalex-snapshot
ISAC for Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_7openalex-snapshot
Training Parallel Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_8openalex-snapshot
Dynamic Approach for Switching Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_9openalex-snapshot
Evolving Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-50137-6_7openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_4openalex-snapshot
Simple Rules for Low-Knowledge Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_31openalex-snapshot
A Statistical Approach for Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_18openalex-snapshot
Introducing esra, a Relational Language for Modelling Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_2openalex-snapshot
Synthesis of Programs in Computational Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-28633-2_17openalex-snapshot
Methods of Automatic Algorithm Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_3openalex-snapshot
Languages versus Packages for Constraint Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_25openalex-snapshot
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-01799-5_7openalex-snapshot
Adaptive Constraint Satisfaction: The Quickest First Principle
inferred← citeshttps://doi.org/10.1007/978-3-642-03246-2_24openalex-snapshot
Managing Diversity on an AIS That Solves 3-Colouring Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_14openalex-snapshot
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_27openalex-snapshot
Ensemble Classification for Constraint Solver Configuration
inferred← citeshttps://doi.org/10.1007/978-3-642-15844-5_3openalex-snapshot
Optimisation and Generalisation: Footprints in Instance Space
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_4openalex-snapshot
Case-Based Reasoning for Autonomous Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_19openalex-snapshot
Predicting Good Propagation Methods for Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/bfb0017453openalex-snapshot
Configurable solvers: Tailoring general methods to specific applications
inferred← citeshttps://doi.org/10.1007/bfb0026790openalex-snapshot
Knowledge acquisition for the onboard planner of an autonomous spacecraft
inferred← citeshttps://doi.org/10.1007/s10472-010-9191-0openalex-snapshot
Tradeoffs in the empirical evaluation of competing algorithm designs
inferred← citeshttps://doi.org/10.1007/s10601-017-9275-0openalex-snapshot
Progress towards the Holy Grail
inferred← citeshttps://doi.org/10.1007/s10601-026-09394-5openalex-snapshot
Automatically configuring constraint satisfaction programs: a retrospective
inferred← citeshttps://doi.org/10.1007/s10703-024-00449-yopenalex-snapshot
Construction of verifier combinations from off-the-shelf components
inferred← citeshttps://doi.org/10.1007/s10710-013-9186-9openalex-snapshot
Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.04.044openalex-snapshot
Prey predator hyperheuristic
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.001openalex-snapshot
Revisiting constraint-directed search
inferred← citeshttps://doi.org/10.1016/j.orp.2020.100177openalex-snapshot
Multi-objective evolutionary search strategies in constraint programming
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00048-xopenalex-snapshot
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
inferred← citeshttps://doi.org/10.1016/s0096-0551(01)00010-8openalex-snapshot
NP-SPEC: an executable specification language for solving all problems in NP
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80106-4openalex-snapshot
Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1023/a:1009740804951openalex-snapshot
Constraint Programming: Strategic Directions
inferred← citeshttps://doi.org/10.1023/a:1014450507312openalex-snapshot
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1057/jors.2013.71openalex-snapshot
Hyper-heuristics: a survey of the state of the art
inferred← citeshttps://doi.org/10.1080/09528130410001724797openalex-snapshot
Automatic evaluation and selection of problem-solving methods: theory and experiments
inferred← citeshttps://doi.org/10.1109/aero.2000.879331openalex-snapshot
Hypothesis generation strategies for adaptive problem solving [spacecraft mission control]
inferred← citeshttps://doi.org/10.1109/ase.1997.632820openalex-snapshot
A structured approach for synthesizing planners from specifications
inferred← citeshttps://doi.org/10.1109/cec.2004.1330866openalex-snapshot
Evolving algorithms for constraint satisfaction
inferred← citeshttps://doi.org/10.1109/icse.2012.6227151openalex-snapshot
An automated approach to generating efficient constraint solvers
inferred← citeshttps://doi.org/10.1109/icsmc.2007.4414171openalex-snapshot
Evaluation of representations in AI problem solving
inferred← citeshttps://doi.org/10.1109/ictai.2012.123openalex-snapshot
Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.39openalex-snapshot
Module Placement Using Constraint Programming in Run-Time Reconfigurable Systems
inferred← citeshttps://doi.org/10.1109/nabic.2009.5393568openalex-snapshot
Hyper-heuristic decision tree induction
inferred← citeshttps://doi.org/10.1109/sccc.1998.730795openalex-snapshot
Evolutionary algorithms for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/tevc.2022.3211336openalex-snapshot
Automated Benchmark-Driven Design and Explanation of Hyperparameter Optimizers
inferred← citeshttps://doi.org/10.1109/wicsa.2011.37openalex-snapshot
Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2005.00277.xopenalex-snapshot
LEARNING TO SUPPORT CONSTRAINT PROGRAMMERS
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2005.00278.xopenalex-snapshot
APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS
inferred← citeshttps://doi.org/10.1145/242223.242279openalex-snapshot
Strategic directions in constraint programming
inferred← citeshttps://doi.org/10.1145/264216.264220openalex-snapshot
Reactive search, a history-sensitive heuristic for MAX-SAT
inferred← citeshttps://doi.org/10.1145/3468264.3468566openalex-snapshot
Generating efficient solvers from constraint models
inferred← citeshttps://doi.org/10.1162/evco.2008.16.1.31openalex-snapshot
Automated Discovery of Local Search Heuristics for Satisfiability Testing
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0388openalex-snapshot
Combining Constraint Programming and Local Search for Job-Shop Scheduling
inferred← citeshttps://doi.org/10.1561/9781680838992openalex-snapshot
Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT
inferred← citeshttps://doi.org/10.1609/aimag.v35i3.2460openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.1613/jair.2808openalex-snapshot
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1613/jair.2861openalex-snapshot
ParamILS: An Automatic Algorithm Configuration Framework
inferred← citeshttps://doi.org/10.1613/jair.428openalex-snapshot
Synthesizing Customized Planners from Specifications
inferred← citeshttps://doi.org/10.1613/jair.445openalex-snapshot
When Gravity Fails: Local Search Topology
inferred← citeshttps://doi.org/10.1613/jair.518openalex-snapshot
Adaptive Parallel Iterative Deepening Search
inferred← citeshttps://doi.org/10.21236/ada258932openalex-snapshot
Issues in Requirements Elicitation
inferred← citeshttps://doi.org/10.21236/ada597663openalex-snapshot
Automatic Representation Changes in Problem Solving
inferred← citeshttps://doi.org/10.25904/1912/2469openalex-snapshot
Constraint Weighting Local Search for Constraint Satisfaction
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-485openalex-snapshot
Heuristics for Dynamically Adapting Propagation
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-873openalex-snapshot
Learning When to Use Lazy Learning in Constraint Solving
inferred← citeshttps://doi.org/10.3233/aic-2009-0450openalex-snapshot
Heuristics for dynamically adapting propagation in constraint satisfaction problems
inferred← citeshttps://doi.org/10.3233/aic-2012-0533openalex-snapshot
An evaluation of machine learning in algorithm selection for search problems
inferred← citeshttps://doi.org/10.3390/app12136316openalex-snapshot
A Literature Survey on Offline Automatic Algorithm Configuration
inferred← citeshttps://doi.org/10.4018/978-1-59140-450-7.ch003openalex-snapshot
Machine Learning for Adaptive Planning
inferred← citeshttps://doi.org/10.4018/978-1-59140-450-7.ch004openalex-snapshot
Plan Optimization by Plan Rewriting
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4326openalex-snapshot
Machine learning for constraint solver design -- A case study for the alldifferent constraint
inferred← citeshttps://doi.org/10.5220/0003660400230031openalex-snapshot
EVOLVED PREAMBLES FOR MAX-SAT HEURISTICS
inferred← citeshttps://doi.org/10.70675/37ac3f0fzf87ez4642zab6ez000b386a7a0eopenalex-snapshot
Learning during search
inferred← citeshttps://doi.org/10.70675/4854f682z99a6z4bc8zb2bczd170773a1677openalex-snapshot
Per Instance Algorithm Configuration for Continuous Black Box Optimization
inferred← citeshttps://doi.org/10.7551/mitpress/9780262529082.003.0010openalex-snapshot
What Is a Library?
inferred← citeshttps://doi.org/10.9781/ijimai.2016.3712openalex-snapshot
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
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.