On the public citation graph
From restricted path consistency to max-restricted path consistency
0 signed · 65 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-58601-6_86openalex-snapshot
Contradicting conventional wisdom in constraint satisfaction
inferredcites →https://doi.org/10.1007/bfb0017448openalex-snapshot
From restricted path consistency to max-restricted path consistency
inferredcites →https://doi.org/10.1016/0004-3702(80)90051-xopenalex-snapshot
Increasing tree search efficiency for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(86)90083-4openalex-snapshot
Arc and path consistency revisited
inferredcites →https://doi.org/10.1016/0004-3702(94)90041-8openalex-snapshot
Arc-consistency and arc-consistency again
inferredcites →https://doi.org/10.1109/caia.1995.378792openalex-snapshot
Improving domain filtering using restricted path consistency
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0087openalex-snapshot
Basic CP Theory: Consistency And Propagation (Advanced)
inferred← citeshttps://doi.org/10.1002/9780470612309.ch4openalex-snapshot
Constraint Propagation and Implementation
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_19openalex-snapshot
Maintaining Arc-Consistency within Dynamic Backtracking
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_54openalex-snapshot
Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_30openalex-snapshot
Restricted Path Consistency Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_6openalex-snapshot
A Microstructure-Based Family of Tractable Classes for CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_36openalex-snapshot
A Synthesis of Constraint Satisfaction and Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_67openalex-snapshot
Improved Algorithms for Max-restricted Path Consistency
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_13openalex-snapshot
Solution Directed Backjumping for QCSP
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_20openalex-snapshot
Learning How to Propagate Using Random Probing
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_9openalex-snapshot
Improving the Performance of maxRPC
inferred← citeshttps://doi.org/10.1007/978-3-642-19486-3_6openalex-snapshot
Integrating Strong Local Consistencies into Constraint Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_15openalex-snapshot
A Framework for Decision-Based Consistencies
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_29openalex-snapshot
MaxRPC Algorithms Based on Bitwise Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_29openalex-snapshot
Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_50openalex-snapshot
Revisiting Neighborhood Inverse Consistency on Binary CSPs
inferred← citeshttps://doi.org/10.1007/s10462-021-10012-4openalex-snapshot
Adaptive constraint propagation in constraint satisfaction: review and evaluation
inferred← citeshttps://doi.org/10.1007/s10489-017-1064-3openalex-snapshot
OrBAC from access control model to access usage model
inferred← citeshttps://doi.org/10.1007/s10601-009-9080-5openalex-snapshot
Efficient algorithms for singleton arc consistency
inferred← citeshttps://doi.org/10.1007/s10601-011-9110-yopenalex-snapshot
New algorithms for max restricted path consistency
inferred← citeshttps://doi.org/10.1007/s10601-014-9174-6openalex-snapshot
Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
inferred← citeshttps://doi.org/10.1007/s10601-016-9250-1openalex-snapshot
Triangle-based consistencies for cost function networks
inferred← citeshttps://doi.org/10.1007/s10601-016-9255-9openalex-snapshot
Revisiting restricted path consistency
inferred← citeshttps://doi.org/10.1007/s10601-018-9298-1openalex-snapshot
Neighborhood singleton consistencies
inferred← citeshttps://doi.org/10.1016/j.artint.2003.06.004openalex-snapshot
Cyclic consistency: A local reduction operation for binary valued constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2007.09.001openalex-snapshot
Theoretical analysis of singleton arc consistency and its extensions
inferred← citeshttps://doi.org/10.1016/j.artint.2007.10.016openalex-snapshot
Domain filtering consistencies for non-binary constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.042openalex-snapshot
Local consistency for extended CSPs
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1023/a:1011454308633openalex-snapshot
Random Constraint Satisfaction: Flaws and Structure
inferred← citeshttps://doi.org/10.1109/ictai.2012.33openalex-snapshot
Partial Max-restricted Path Consistency
inferred← citeshttps://doi.org/10.1109/ictai.2012.38openalex-snapshot
Efficient Singleton Consistency by Combining Forward Checking and Bound Consistency
inferred← citeshttps://doi.org/10.1109/ictai.2014.73openalex-snapshot
Hidden Tractable Classes: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/spac.2017.8304327openalex-snapshot
The research on the improved light version max restricted path consistency algorithm with the learned value ordering heuristics
inferred← citeshttps://doi.org/10.1109/spac.2017.8304329openalex-snapshot
Improving on the restricted path consistency constraint propagation algorithms based on the bitwise
inferred← citeshttps://doi.org/10.1109/tai.1999.809787openalex-snapshot
A strong local consistency for constraint satisfaction
inferred← citeshttps://doi.org/10.1142/s0218213008004163openalex-snapshot
STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS
inferred← citeshttps://doi.org/10.1145/2903220.2903228openalex-snapshot
Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies
inferred← citeshttps://doi.org/10.12681/eadd/26336openalex-snapshot
Adaptive strategies for solving contraint satisfaction problems
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8504openalex-snapshot
Efficient Algorithms for Strong Local Consistencies in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2017/102openalex-snapshot
On Neighborhood Singleton Consistencies
inferred← citeshttps://doi.org/10.2991/caai-17.2017.87openalex-snapshot
lmaxRPCls: An Algorithm Utilizing Light Symmetry for Approximating maxRPC in Constraint Programming
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-485openalex-snapshot
Heuristics for Dynamically Adapting Propagation
inferred← citeshttps://doi.org/10.3233/aic-2009-0450openalex-snapshot
Heuristics for dynamically adapting propagation in constraint satisfaction problems
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5189openalex-snapshot
Improving the Performance of maxRPC
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05316openalex-snapshot
Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization
inferred← citeshttps://doi.org/10.4995/thesis/10251/1946openalex-snapshot
Particionamiento y resolución distribuida multivariable de problemas de satisfacción de restricciones
inferred← citeshttps://doi.org/10.70675/45d3899az8ec7z4c35zbc8fzbf3059eb4b43openalex-snapshot
Programmation par contraintes et chimie théorique : utilisation du formalisme CSP pour résoudre des problématiques liées aux benzénoïdes
inferred← citeshttps://doi.org/10.70675/82a54e1dz8c85z4f6dz9f3az60324fa2f8c1openalex-snapshot
Hybridation de techniques d'apprentissage de clauses en programmation par contraintes
inferred← citeshttps://doi.org/10.70675/a11f38b4z34ccz4d83z9bcfzc04f7983025eopenalex-snapshot
Strong consistencies for weighted constraint satisfaction problems
inferred← citeshttps://doi.org/10.70675/a4e03b4bz812cz48cdzaceez9a6f8a20f63eopenalex-snapshot
Hypergraphes partiels de largeur bornée, décompositions arborescentes et contraintes globales
inferred← citeshttps://doi.org/10.70675/bddb67b3z0962z4b4bzb666z1937f6cf173eopenalex-snapshot
Higher-Level Consistencies : When, Where, and How Much
showing the first 57 of 58 · page through all 58
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.