On the public citation graph
Tractable disjunctive constraints
0 signed · 40 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-50939-9_122openalex-snapshot
Independence of negative constraints
inferredcites →https://doi.org/10.1007/3-540-60299-2_17openalex-snapshot
A unifying framework for tractable constraints
inferredcites →https://doi.org/10.1007/3-540-60299-2_4openalex-snapshot
From local to global consistency in temporal constraint networks
inferredcites →https://doi.org/10.1007/3-540-61551-2_82openalex-snapshot
Tractable disjunctions of linear constraints
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/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
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(87)90002-6openalex-snapshot
Network-based heuristics for constraint-satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(91)90059-sopenalex-snapshot
Constraint relaxation may be perfect
inferredcites →https://doi.org/10.1016/0004-3702(92)90009-mopenalex-snapshot
Structure identification in relational data
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(93)90063-hopenalex-snapshot
Fast parallel constraint satisfaction
inferredcites →https://doi.org/10.1016/0004-3702(94)90003-5openalex-snapshot
Decomposing constraint satisfaction problems using database techniques
inferredcites →https://doi.org/10.1016/0004-3702(94)90021-3openalex-snapshot
Characterising tractable constraints
inferredcites →https://doi.org/10.1016/0004-3702(95)00107-7openalex-snapshot
Tractable constraints on ordered domains
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/0747-7171(92)90002-lopenalex-snapshot
A canonical form for generalized linear constraints
inferredcites →https://doi.org/10.1016/b978-1-4832-1447-4.50034-1openalex-snapshot
Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report
inferredcites →https://doi.org/10.1016/c2013-0-07627-xopenalex-snapshot
Foundations of Constraint Satisfaction
inferredcites →https://doi.org/10.1016/s0304-3975(96)00192-2openalex-snapshot
From local to global consistency in temporal constraint networks
inferredcites →https://doi.org/10.1145/200836.200848openalex-snapshot
Reasoning about temporal relations
inferredcites →https://doi.org/10.1145/210346.210347openalex-snapshot
On the minimality and global consistency of row-convex constraint networks
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_3openalex-snapshot
Constraint (Logic) Programming: A Survey on Research and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_10openalex-snapshot
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_13openalex-snapshot
New Tractable Classes from Old
inferred← citeshttps://doi.org/10.1007/s10601-006-9007-3openalex-snapshot
The Complexity of Reasoning with Global Constraints
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00055-2openalex-snapshot
Querying temporal and spatial constraint networks in PTIME☆☆A preliminary version of this paper appeared in the proceedings of AAAI-99. A different version of this paper (aimed at a database audience) appeared in the proceedings of the workshop STDBM99.
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1023/a:1025623111033openalex-snapshot
New Tractable Classes From Old
inferred← citeshttps://doi.org/10.1145/355483.355485openalex-snapshot
Building tractable disjunctive constraints
inferred← citeshttps://doi.org/10.13189/ms.2020.080614openalex-snapshot
Algorithmic Verification of Constraint Satisfaction Method on Timetable Problem
inferred← citeshttps://doi.org/10.1613/jair.693openalex-snapshot
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
inferred← citeshttps://doi.org/10.37614/2949-1215.2023.14.7.005openalex-snapshot
Reasoning with temporal constraints
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.