On the public citation graph

Representation selection for constraint satisfaction: a case study using n-queens

0 signed · 70 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.1016/0004-3702(76)90008-4openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(80)90033-8openalex-snapshot
Toward a model of representation changes
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/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
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/0020-0255(94)00080-uopenalex-snapshot
Constraint satisfaction in prolog: Complexity and theory-based heuristics
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50006-4openalex-snapshot
On Representations of Problems of Reasoning about Actions
inferredcites →https://doi.org/10.1016/s0004-3702(83)80008-3openalex-snapshot
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics
inferredcites →https://doi.org/10.1109/tpami.1979.4766903openalex-snapshot
The Consistent Labeling Problem: Part I
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00328.xopenalex-snapshot
Constraint satisfaction algorithms1
inferredcites →https://doi.org/10.7282/t37s7s9dopenalex-snapshot
Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and their Expected Complexities

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470612309.ch8openalex-snapshot
The Automatic Generation of Redundant Representations and Channeling Constraints
inferred← citeshttps://doi.org/10.1002/9781394249817.ch2openalex-snapshot
Encoding in General
inferred← citeshttps://doi.org/10.1007/11536406_19openalex-snapshot
Using CBR to Select Solution Strategies in Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_8openalex-snapshot
Constraint Programming Lessons Learned from Crossword Puzzles
inferred← citeshttps://doi.org/10.1007/978-1-4471-0651-7_28openalex-snapshot
CSP — There is more than one way to model it
inferred← citeshttps://doi.org/10.1007/978-1-4471-4129-7_6openalex-snapshot
Propositional Logic: SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-1-4614-5134-1_17openalex-snapshot
Homogeneous and Non-homogeneous Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-08266-5_9openalex-snapshot
Evaluation and Comparison of Brute-Force Search and Constrained Optimization Algorithms to Solve the N-Queens Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-22264-6_14openalex-snapshot
Characterizing Data Dependence Constraints for Dynamic Reliability Using N-Queens Attack Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-23135-8_4openalex-snapshot
Two Phase User Driven Schema Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_107openalex-snapshot
Using Case-Based Reasoning to Write Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_8openalex-snapshot
Reformulating Constraint Satisfaction Problems to Improve Scalability
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_14openalex-snapshot
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-39808-7_3openalex-snapshot
Measuring Supportiveness of the Internet and Mobile Platforms for Personalized Ad
inferred← citeshttps://doi.org/10.1007/978-94-015-9070-9_8openalex-snapshot
Reanalysis and Limited Repair Parsing: Leaping off the Garden Path
inferred← citeshttps://doi.org/10.1007/978-981-99-0550-8_27openalex-snapshot
A Non-Recursive Space-Efficient Blind Approach to Find All Possible Solutions to the N-Queens Problem
inferred← citeshttps://doi.org/10.1007/s10182-008-0084-zopenalex-snapshot
Integrated methodology for multiple systems estimation and record linkage using a missing data formulation
inferred← citeshttps://doi.org/10.1007/s10601-009-9075-2openalex-snapshot
Redundant modeling in permutation weighted constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10601-017-9275-0openalex-snapshot
Progress towards the Holy Grail
inferred← citeshttps://doi.org/10.1007/s10601-026-09395-4openalex-snapshot
Reflections on Essence: a constraint language for specifying combinatorial problems
inferred← citeshttps://doi.org/10.1007/s11192-016-1872-yopenalex-snapshot
Improving co-authorship network structures by combining multiple data sources: evidence from Italian academic statisticians
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90156-popenalex-snapshot
Linear congruence equations for the solutions of the N-Queens problem
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90018-hopenalex-snapshot
Precision complexity analysis: A case study using insertion sort
inferred← citeshttps://doi.org/10.1016/0020-0255(94)00080-uopenalex-snapshot
Constraint satisfaction in prolog: Complexity and theory-based heuristics
inferred← citeshttps://doi.org/10.1016/0167-9236(96)00033-4openalex-snapshot
Anticipatory Pruning Networks and forward checking in CLP over continuous domains
inferred← citeshttps://doi.org/10.1016/0925-2312(95)00023-yopenalex-snapshot
Design of neurocomputer architectures for large-scale constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-660561-7.50011-9openalex-snapshot
AUTOMOBILE TRANSMISSION DESIGN AS A CONSTRAINT SATISFACTION PROBLEM: FIRST RESULTS
inferred← citeshttps://doi.org/10.1016/j.procs.2016.06.088openalex-snapshot
ATSSI: Abstractive Text Summarization Using Sentiment Infusion
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00104-7openalex-snapshot
Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference.
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/s0004-3702(96)00027-6openalex-snapshot
A theoretical evaluation of selected backtracking algorithms
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)45557-1openalex-snapshot
Modelling with Objects and Constraints: Production Planning in Horticulture
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80015-5openalex-snapshot
Modelling
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1874-5946(98)80043-6openalex-snapshot
Short time memory problems
inferred← citeshttps://doi.org/10.1016/s1874-5946(98)80072-2openalex-snapshot
Short time memory problems
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1017/s0890060400002651openalex-snapshot
Automobile transmission design as a constraint satisfaction problem: modelling the kinematic level
inferred← citeshttps://doi.org/10.1017/s0956796801004051openalex-snapshot
Modular lazy search for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1023/a:1006558104682openalex-snapshot
A Glimpse of Constraint Satisfaction
inferred← citeshttps://doi.org/10.1023/a:1011432307724openalex-snapshot
A Context for Constraint Satisfaction Problem Formulation Selection
inferred← citeshttps://doi.org/10.1098/rstb.2003.1317openalex-snapshot
Abstraction and reformulation in artificial intelligence
inferred← citeshttps://doi.org/10.1109/21.135698openalex-snapshot
Fast search algorithms for the n-queens problem
inferred← citeshttps://doi.org/10.1109/bibmw.2010.5703843openalex-snapshot
Identifying inconsistencies in multiple clinical practice guidelines for a patient with co-morbidity
inferred← citeshttps://doi.org/10.1109/caia.1991.120877openalex-snapshot
Automobile transmission design as a constraint satisfaction problem: first results
inferred← citeshttps://doi.org/10.1109/icecco.2014.6997584openalex-snapshot
Rakhya's method: A case based approach to solve n-queens problem
inferred← citeshttps://doi.org/10.1109/icstcc.2014.6982509openalex-snapshot
Rakhya's method: A case based approach to solve n-queens problem
inferred← citeshttps://doi.org/10.1109/ictai66417.2025.00034openalex-snapshot
Utilizing Regularization for Generating Linear Pseudo-Boolean Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/induscon.2010.5740074openalex-snapshot
Study of the application of genetic algorithms in optimization of cutting glass sheets
inferred← citeshttps://doi.org/10.1109/secon.1992.202348openalex-snapshot
The N-queens problem and genetic algorithms
inferred← citeshttps://doi.org/10.1145/101340.101343openalex-snapshot
A polynomial time algorithm for the N-Queens problem
inferred← citeshttps://doi.org/10.1145/131214.131227openalex-snapshot
Different perspectives of the N-Queens problem
inferred← citeshttps://doi.org/10.18174/194236openalex-snapshot
Improving support for greenhouse climate management : an exploration of a knowledge-based system
inferred← citeshttps://doi.org/10.21105/joss.00639openalex-snapshot
LearnSAT: A SAT Solver for Education
inferred← citeshttps://doi.org/10.2307/2669348openalex-snapshot
Natural Law, Theology, and Morality in Locke
inferred← citeshttps://doi.org/10.29007/7thsopenalex-snapshot
Constraint Problem Specification as Compression
inferred← citeshttps://doi.org/10.4230/lites-v004-i001-a005openalex-snapshot
Characterizing Data Dependence Constraints for Dynamic Reliability Using n-Queens Attack Domains
inferred← citeshttps://doi.org/10.7939/r3cc0tt17openalex-snapshot
A Theoretical Evaluation of Selected Backtracking Algorithms
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.