On the public citation graph
A simple and efficient boolean solver for Constraint Logic Programming
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-53162-9_39openalex-snapshot
Propositional calculus problems in CHIP
inferredcites →https://doi.org/10.1007/3-540-58402-1_18openalex-snapshot
Clp(B): Combining simplicity and efficiency in boolean Constraint solving
inferredcites →https://doi.org/10.1007/bf01531074openalex-snapshot
Branch-and-cut solution of inference problems in propositional logic
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0016843openalex-snapshot
Ordered Binary Decision Diagrams and the Davis-Putnam procedure
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)90051-xopenalex-snapshot
Increasing tree search efficiency for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90006-jopenalex-snapshot
Constraint satisfaction using constraint logic programming
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/0020-0190(93)90258-bopenalex-snapshot
An exact algorithm for the constraint satisfaction problem: Application to logical inference
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/0743-1066(89)90009-5openalex-snapshot
Algorithms for testing the satisfiability of propositional formulae
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferredcites →https://doi.org/10.1109/lics.1992.185546openalex-snapshot
The category of constraint systems is Cartesian-closed
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00328.xopenalex-snapshot
Constraint satisfaction algorithms1
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/3341.3350openalex-snapshot
A generalized implicit enumeration algorithm for graph coloring
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0038openalex-snapshot
Entailment of Finite Domain Constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10704567_8openalex-snapshot
Parallel Execution Models for Constraint Programming over Finite Domains
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_5openalex-snapshot
Some Remarks on Boolean Constraint Propagation
inferred← citeshttps://doi.org/10.1007/3-540-45263-x_8openalex-snapshot
Distributed Splitting of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_33openalex-snapshot
Generation of Test Patterns for Differential Diagnosis of Digital Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-29604-3_4openalex-snapshot
The Boolean Constraint Solver of SWI-Prolog (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-540-30557-6_13openalex-snapshot
Solving Constraints on Sets of Spatial Objects
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00121-2openalex-snapshot
Compiling constraints in clp(FD)
inferred← citeshttps://doi.org/10.1016/j.scico.2018.02.001openalex-snapshot
Boolean constraints in SWI-Prolog: A comprehensive system description
inferred← citeshttps://doi.org/10.1017/cbo9780511615320openalex-snapshot
Principles of Constraint Programming
inferred← citeshttps://doi.org/10.1023/a:1009816801567openalex-snapshot
A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains
inferred← citeshttps://doi.org/10.1109/apsec.2007.39openalex-snapshot
Deriving Product Line Requirements: the RED-PL Guidance Approach
inferred← citeshttps://doi.org/10.1109/aspec.2007.63openalex-snapshot
Deriving Product Line Requirements: the RED-PL Guidance Approach
inferred← citeshttps://doi.org/10.1109/re.2010.36openalex-snapshot
Using Integer Constraint Solving in Reuse Based Requirements Engineering
inferred← citeshttps://doi.org/10.1145/1085099.1085106openalex-snapshot
Constraint logic programming over sets of spatial objects
inferred← citeshttps://doi.org/10.1145/335603.335756openalex-snapshot
A coordination-based chaotic iteration algorithm for constraint propagation
inferred← citeshttps://doi.org/10.1145/963778.963779openalex-snapshot
An interval constraint system for lattice domains
inferred← citeshttps://doi.org/10.1587/transinf.2016edp7313openalex-snapshot
Encoding Argumentation Semantics by Boolean Algebra
inferred← citeshttps://doi.org/10.4114/ia.v9i27.858openalex-snapshot
Un Enfoque Generico y Cooperativo para la Resolucion de Restricciones de Intervalo
inferred← citeshttps://doi.org/10.5802/roia.24openalex-snapshot
De l’influence de Jacques Pitrat sur mes recherches en 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.