On the public citation graph

A logic language for combinatorial optimization

0 signed · 35 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/bf00288958openalex-snapshot
Backtracking with multi-level dynamic search rearrangement
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(78)90029-2openalex-snapshot
A language and a program for stating and solving combinatorial problems
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/0743-1066(90)90052-7openalex-snapshot
Solving large combinatorial problems in logic programming
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50009-2openalex-snapshot
Extending Equation Solving and Constraint Handling in Logic Programming
inferredcites →https://doi.org/10.1051/ro/196903v100171openalex-snapshot
Sur le regroupement optimal des sommets dans un réseau électrique
inferredcites →https://doi.org/10.1051/ro/1984180302111openalex-snapshot
Une étude pratique de découpes de panneaux de bois
inferredcites →https://doi.org/10.1145/321296.321300openalex-snapshot
Backtrack Programming
inferredcites →https://doi.org/10.1145/321420.321422openalex-snapshot
Nondeterministic Algorithms
inferredcites →https://doi.org/10.1145/3341.3350openalex-snapshot
A generalized implicit enumeration algorithm for graph coloring
inferredcites →https://doi.org/10.1145/359642.359654openalex-snapshot
Synthesizing constraint expressions
inferredcites →https://doi.org/10.1145/55674.55703openalex-snapshot
Applications of CHIP to industrial and engineering problems
inferredcites →https://doi.org/10.1287/opre.18.3.549openalex-snapshot
Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration

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-62501-1_23openalex-snapshot
An informal introduction to constraint database systems (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_2openalex-snapshot
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-78545-0_22openalex-snapshot
Künstliche Intelligenz und Operations Research
inferred← citeshttps://doi.org/10.1007/978-3-662-12629-5_74openalex-snapshot
Embedding OR Techniques in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00248011openalex-snapshot
New constructs for the description of combinatorial optimization problems in algebraic modeling languages
inferred← citeshttps://doi.org/10.1007/bf01125797openalex-snapshot
Flang: A language for artificial intelligence
inferred← citeshttps://doi.org/10.1007/bf01720708openalex-snapshot
Modellbasierte Inferenz in CHARME
inferred← citeshttps://doi.org/10.1007/bf02187327openalex-snapshot
A bibliography for the development of an Intelligent Mathematical Programming System
inferred← citeshttps://doi.org/10.1016/s0924-3542(07)80009-0openalex-snapshot
Chapter 6 Future concepts: Some philosophical issues
inferred← citeshttps://doi.org/10.1017/s0269888900005798openalex-snapshot
Constraint logic programming
inferred← citeshttps://doi.org/10.1023/b:anor.0000032574.01332.98openalex-snapshot
Graph Coloring for Air Traffic Flow Management
inferred← citeshttps://doi.org/10.1109/caia.1993.366601openalex-snapshot
Solving 0-1 problems in CLP (PB)
inferred← citeshttps://doi.org/10.1109/cmpcon.1991.128838openalex-snapshot
The CLP language CHIP: constraint solving and applications
inferred← citeshttps://doi.org/10.1109/hicss.1996.495425openalex-snapshot
Algebraic, logical and network representations in the design of software for combinatorial optimization
inferred← citeshttps://doi.org/10.1109/tkde.2004.1269672openalex-snapshot
Optimal models of disjunctive logic programs: semantics, complexity, and computation
inferred← citeshttps://doi.org/10.1137/s0036142995281504openalex-snapshot
Solving Polynomial Systems Using a Branch and Prune Approach
inferred← citeshttps://doi.org/10.1145/178243.178488openalex-snapshot
Backtracking without trailing in CLP (R Lin )
inferred← citeshttps://doi.org/10.1145/210184.210192openalex-snapshot
Backtracking without trailing in CLP (ℜ Lin )
inferred← citeshttps://doi.org/10.1522/030188922openalex-snapshot
Approches hybrides pour la resolution d'un probleme d'ordonnancement industriel /
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.