On the public citation graph

Domain Filtering Consistencies

0 signed · 125 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-45349-0_26openalex-snapshot
Singleton Consistencies
inferredcites →https://doi.org/10.1007/3-540-49481-2_24openalex-snapshot
Random Constraint Satisfaction: theory meets practice
inferredcites →https://doi.org/10.1007/3-540-58601-6_86openalex-snapshot
Contradicting conventional wisdom in constraint satisfaction
inferredcites →https://doi.org/10.1007/3-540-60299-2_16openalex-snapshot
Dynamic variable ordering in CSPs
inferredcites →https://doi.org/10.1007/3-540-61551-2_66openalex-snapshot
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_11openalex-snapshot
Network-Based Heuristics for Constraint-Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_9openalex-snapshot
Tree Search and ARC Consistency in Constraint Satisfaction Algorithms
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(94)90068-xopenalex-snapshot
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0020-0255(79)90023-9openalex-snapshot
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
inferredcites →https://doi.org/10.1016/c2013-0-07627-xopenalex-snapshot
Foundations of Constraint Satisfaction
inferredcites →https://doi.org/10.1016/s0004-3702(98)00105-2openalex-snapshot
Using constraint metaknowledge to reduce arc consistency computation
inferredcites →https://doi.org/10.1023/a:1009812409930openalex-snapshot
Radio Link Frequency Assignment
inferredcites →https://doi.org/10.1109/caia.1995.378792openalex-snapshot
Improving domain filtering using restricted path consistency
inferredcites →https://doi.org/10.1109/tai.1995.479619openalex-snapshot
Path consistency revisited
inferredcites →https://doi.org/10.1109/tai.1996.560465openalex-snapshot
Two new constraint propagation algorithms requiring small space complexity
inferredcites →https://doi.org/10.1109/tai.1999.809787openalex-snapshot
A strong local consistency for constraint satisfaction
inferredcites →https://doi.org/10.1111/j.1467-8640.1993.tb00310.xopenalex-snapshot
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/321296.321300openalex-snapshot
Backtrack Programming
inferredcites →https://doi.org/10.1145/322290.322292openalex-snapshot
A Sufficient Condition for Backtrack-Free Search
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1609/aimag.v13i1.976openalex-snapshot
Algorithms for constraint-satisfaction problems: a survey
inferredcites →https://doi.org/10.3233/aic-1989-2101openalex-snapshot
Constraint Satisfaction Problems: An Overview

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/9780470611821.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9780470611876.ch6openalex-snapshot
Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1002/9781118557563.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118604304.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_14openalex-snapshot
Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/0-387-23152-8_44openalex-snapshot
Using Finite Domains in Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/0-387-28356-0_9openalex-snapshot
Constraint Programming
inferred← citeshttps://doi.org/10.1007/11546207_21openalex-snapshot
Lookahead in Smodels Compared to Local Consistencies in CSP
inferred← citeshttps://doi.org/10.1007/11889205_12openalex-snapshot
Propagation in CSP and SAT
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_3openalex-snapshot
Branch-and-Infer: A Framework for Combining CP and IP
inferred← citeshttps://doi.org/10.1007/978-1-4614-6940-7_14openalex-snapshot
Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_6openalex-snapshot
Constraint Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-88226-5_20openalex-snapshot
New Heuristic Order Based on Tree-Decomposition for Solving CSPs
inferred← citeshttps://doi.org/10.1007/978-3-319-04534-4_6openalex-snapshot
Structural Consistency: A New Filtering Approach for Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_17openalex-snapshot
Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_12openalex-snapshot
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem
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-319-50137-6_9openalex-snapshot
Adapting Consistency in Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_10openalex-snapshot
Backtrack-Free Search for Real-Time Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_54openalex-snapshot
Support Inference for Generic Filtering
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-73817-6_8openalex-snapshot
Extracting Microstructure in Binary Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_32openalex-snapshot
Path Consistency by Dual Consistency
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_33openalex-snapshot
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_26openalex-snapshot
Connecting ABT with Arc Consistency
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_52openalex-snapshot
Constraint-Level Advice for Shaving
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_44openalex-snapshot
Failed Value Consistencies for Constraint Satisfaction
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-30448-4_22openalex-snapshot
Extending Generalized Arc Consistency
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/978-3-642-40627-0_14openalex-snapshot
Adaptive Parameterized Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_15openalex-snapshot
Global Inverse Consistency for Interactive Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-94-017-1689-5openalex-snapshot
Geometric Modeling: Techniques, Applications, Systems and Tools
inferred← citeshttps://doi.org/10.1007/978-94-017-1689-5_11openalex-snapshot
Constraint Satisfaction Techniques for the Generation Phase in Declarative Modeling
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/s10601-007-9015-yopenalex-snapshot
A Constraint-based Approach for Annotating Music Scores with Gestural Information
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-9179-1openalex-snapshot
Strong local consistency algorithms for table constraints
inferred← citeshttps://doi.org/10.1007/s10601-016-9255-9openalex-snapshot
Revisiting restricted path consistency
inferred← citeshttps://doi.org/10.1007/s10601-018-9290-9openalex-snapshot
On a new extension of BTP for binary CSPs
inferred← citeshttps://doi.org/10.1007/s10601-018-9298-1openalex-snapshot
Neighborhood singleton consistencies
inferred← citeshttps://doi.org/10.1007/s10951-010-0171-3openalex-snapshot
Complex university course timetabling
inferred← citeshttps://doi.org/10.1016/b978-155860872-6/50030-5openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.artint.2007.04.001openalex-snapshot
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
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.artint.2009.09.002openalex-snapshot
Reasoning from last conflict(s) in constraint programming
inferred← citeshttps://doi.org/10.1016/j.artint.2016.09.001openalex-snapshot
Computing and restoring global inverse consistency in interactive constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107638openalex-snapshot
ISIEM: A methodology to deploy a knowledge-based system to support bidding process
inferred← citeshttps://doi.org/10.1016/j.ins.2007.03.030openalex-snapshot
Partition search for non-binary constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.jclepro.2012.10.048openalex-snapshot
Benefits and limits of a Constraint Satisfaction Problem/Life Cycle Assessment approach for the ecodesign of complex systems: a case applied to a hybrid passenger ferry
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.042openalex-snapshot
Local consistency for extended CSPs
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00210-2openalex-snapshot
Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program.
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12010-6openalex-snapshot
Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80007-6openalex-snapshot
Constraint Propagation
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1080/09511920701575278openalex-snapshot
Aiding design with constraints: an extension of quad trees in order to deal with piecewise functions
inferred← citeshttps://doi.org/10.1080/09528130410001724968openalex-snapshot
Distributed singleton consistency
inferred← citeshttps://doi.org/10.1080/19397038.2015.1085110openalex-snapshot
The influence of the level of definition of functional specifications on the environmental performances of a complex system. EcoCSP approach
inferred← citeshttps://doi.org/10.1109/ictai.2006.92openalex-snapshot
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraing Programming
inferred← citeshttps://doi.org/10.1109/ictai.2007.170openalex-snapshot
A Music Information Retrieval Approach Based on Power Laws
inferred← citeshttps://doi.org/10.1109/ictai.2007.9openalex-snapshot
Strong Inverse Consistencies for Non-Binary CSPs
inferred← citeshttps://doi.org/10.1109/ictai.2010.45openalex-snapshot
A New Filtering Based on Decomposition of Constraint Sub-Networks
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/ictai.2014.112openalex-snapshot
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied
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/tpami.2007.1036openalex-snapshot
A Linear Programming Approach to Max-Sum Problem: A Review
inferred← citeshttps://doi.org/10.1109/tpami.2009.134openalex-snapshot
Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/tpami.2014.2363833openalex-snapshot
Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings
inferred← citeshttps://doi.org/10.1142/s0218213008003765openalex-snapshot
OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING
inferred← citeshttps://doi.org/10.1142/s0218213008004163openalex-snapshot
STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218213008004187openalex-snapshot
PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH
inferred← citeshttps://doi.org/10.1142/s0218213018600023openalex-snapshot
Methods for Parallelizing Constraint Propagation through the Use of Strong Local Consistencies
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
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.v25i1.7825openalex-snapshot
Solving Difficult CSPs with Relational Neighborhood Inverse Consistency
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8135openalex-snapshot
An Efficient Higher-Order Consistency Algorithm for Table Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8622openalex-snapshot
Extending STR to a Higher-Order Consistency
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9756openalex-snapshot
Strong Bounds Consistencies and Their Application to Linear Constraints
inferred← citeshttps://doi.org/10.1613/jair.3180openalex-snapshot
Second-Order Consistencies
inferred← citeshttps://doi.org/10.24963/ijcai.2017/102openalex-snapshot
On Neighborhood Singleton Consistencies
inferred← citeshttps://doi.org/10.2991/lemcs-15.2015.204openalex-snapshot
A New Adaptive Parameterized Consistency Algorithm
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.3233/fi-2010-307openalex-snapshot
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
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.5821/dissertation-2117-94749openalex-snapshot
Multi-objective optimization in graphical models
inferred← citeshttps://doi.org/10.70675/1af58a16z8bf3z4690zb5ecz6c4ed2d8eedbopenalex-snapshot
Modélisation et optimisation multi-objectifs pour l'extraction de connaissance
inferred← citeshttps://doi.org/10.70675/652e5f60z5df2z451dz87d6z1734c2bd6d86openalex-snapshot
Intégration des problèmes de satisfaction de contraintes distribués et sécurisés dans les systèmes d'aide à la décision à base de connaissances
inferred← citeshttps://doi.org/10.70675/a11f38b4z34ccz4d83z9bcfzc04f7983025eopenalex-snapshot
Strong consistencies for weighted constraint satisfaction problems
inferred← citeshttps://doi.org/10.70675/d800c400z9341z4e70z9655zf43df31ab72eopenalex-snapshot
Fouille de données déclarative basée sur la programmation par 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.