On the public citation graph
Interval propagation to reason about sets: Definition and implementation of a practical language
0 signed · 162 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-16780-3_113openalex-snapshot
NP-completeness of the set unification and matching problems
inferredcites →https://doi.org/10.1007/3-540-54444-5_123openalex-snapshot
Short overview of the CLPS system
inferredcites →https://doi.org/10.1007/3-540-55844-6_141openalex-snapshot
Metastructures vs. attributed variables in the context of extensible unification
inferredcites →https://doi.org/10.1007/3-540-59155-9_1openalex-snapshot
Interval constraint logic programming
inferredcites →https://doi.org/10.1007/3-540-60299-2_29openalex-snapshot
Solving crew scheduling problems by constraint programming
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-0349-4_15openalex-snapshot
Membership-Constraints and Complexity in Logic Programming with Sets
inferredcites →https://doi.org/10.1007/bfb0024181openalex-snapshot
A new data structure for implementing extensions to Prolog
inferredcites →https://doi.org/10.1016/0004-3702(70)90003-2openalex-snapshot
REF-ARF: A system for solving problems stated as procedures
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(85)90041-4openalex-snapshot
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
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/0743-1066(90)90052-7openalex-snapshot
Solving large combinatorial problems in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(91)90036-oopenalex-snapshot
Set constructors in a logic database language
inferredcites →https://doi.org/10.1016/0743-1066(92)90040-aopenalex-snapshot
Compilation of set terms in the logic data language (LDL)
inferredcites →https://doi.org/10.1016/0743-1066(93)90045-iopenalex-snapshot
Interval computation as deduction in chip
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1016/s0167-5060(08)70831-8openalex-snapshot
Covering, Packing and Knapsack Problems
inferredcites →https://doi.org/10.1287/mnsc.39.6.657openalex-snapshot
Solving Airline Crew Scheduling Problems by Branch-and-Cut
inferredcites →https://doi.org/10.22028/d291-36868openalex-snapshot
Unification of sets and multisets
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP
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.ch4openalex-snapshot
Constraint Propagation and Implementation
inferred← citeshttps://doi.org/10.1002/net.21682openalex-snapshot
Partial target coverage to extend the lifetime in wireless multi‐role sensor networks
inferred← citeshttps://doi.org/10.1002/stvr.300openalex-snapshot
Preamble computation in automated test case generation using constraint logic programming
inferred← citeshttps://doi.org/10.1007/11564751_104openalex-snapshot
Speeding Up Constrained Path Solvers with a Reachability Propagator
inferred← citeshttps://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferred← citeshttps://doi.org/10.1007/11564751_70openalex-snapshot
Beyond Finite Domains: The All Different and Global Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11754602_1openalex-snapshot
The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables
inferred← citeshttps://doi.org/10.1007/11754602_9openalex-snapshot
Views and Iterators for Generic Constraint Implementations
inferred← citeshttps://doi.org/10.1007/11889205_41openalex-snapshot
Generating Propagators for Finite Set Constraints
inferred← citeshttps://doi.org/10.1007/11941439_5openalex-snapshot
Heyting Domains for Constraint Abduction
inferred← citeshttps://doi.org/10.1007/11941439_9openalex-snapshot
Finite Domain Bounds Consistency Revisited
inferred← citeshttps://doi.org/10.1007/3-540-40888-6_17openalex-snapshot
Numeric Constraint Resolution in Logic Programming Based on Subdefinite Models
inferred← citeshttps://doi.org/10.1007/3-540-44629-x_20openalex-snapshot
A Language for Specifying Complete Timetabling Problems
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_22openalex-snapshot
Dominance Constraints with Set Operators
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_28openalex-snapshot
Modelling Digital Circuits Problems with Set Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_16openalex-snapshot
Compiling High-Level Type Constructors in Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_19openalex-snapshot
A Meta-heuristic for Subset Problems
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_24openalex-snapshot
Practical Investigation of Constraints with Graph Views
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_20openalex-snapshot
Towards Inferring Labelling Heuristics for CSP Application Domains
inferred← citeshttps://doi.org/10.1007/3-540-45945-6openalex-snapshot
Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_14openalex-snapshot
Exploiting Constraints for Domain Managing in CLP(FD)
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_14openalex-snapshot
CLPS-B—A Constraint Solver for B
inferred← citeshttps://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_32openalex-snapshot
Solving the Kirkman’s Schoolgirl Problem in a Few Seconds
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_20openalex-snapshot
Constraint-based Problem Decomposition for a Key Configuration Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-35602-0_22openalex-snapshot
Implementing Constraint Solvers in B-Prolog
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_17openalex-snapshot
The Maximum Weighted Submatrix Coverage Problem: A CP Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-58942-4_30openalex-snapshot
Insertion Sequence Variables for Hybrid Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_10openalex-snapshot
A Decision Procedure for Sets, Binary Relations and Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_18openalex-snapshot
Introducing esra, a Relational Language for Modelling Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_27openalex-snapshot
Set Domain Propagation Using ROBDDs
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_28openalex-snapshot
Global Constraints for Integer and Set Value Precedence
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_44openalex-snapshot
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_69openalex-snapshot
Relation Variables in Qualitative Spatial Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-30221-6_26openalex-snapshot
Relation Variables in Qualitative Spatial Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-30549-1_61openalex-snapshot
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_103openalex-snapshot
Symmetry Breaking Ordering Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_36openalex-snapshot
A Synthesis of Constraint Satisfaction and Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_49openalex-snapshot
Consistency and Propagation with Multiset Constraints: A Formal Viewpoint
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_71openalex-snapshot
Constraints over Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_5openalex-snapshot
The “Not-Too-Heavy Spanning Tree” Constraint
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-540-85958-1_44openalex-snapshot
Perfect Derived Propagators
inferred← citeshttps://doi.org/10.1007/978-3-540-88309-8_8openalex-snapshot
Using Indexed Finite Set Variables for Set Bounds Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_13openalex-snapshot
Open Constraints in a Boundable World
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_63openalex-snapshot
Evaluation of Length-Lex Set Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-12165-4_35openalex-snapshot
Combining CSP and Constraint-Based Mining for Pattern Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_40openalex-snapshot
Exponential Propagation for Set Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_44openalex-snapshot
Constraint Programming for Mining n-ary Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_61openalex-snapshot
Checking and Filtering Global Set Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-23845-1_2openalex-snapshot
Data Types and Lexical Conventions
inferred← citeshttps://doi.org/10.1007/978-3-642-25838-1_5openalex-snapshot
Combining Constraint Programming and Constraint-Based Mining for Pattern Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_39openalex-snapshot
Multidimensional Bin Packing Revisited
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/s00607-011-0169-5openalex-snapshot
Solving set-valued constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10009-003-0123-8openalex-snapshot
CLPS–B – A constraint solver to animate a B specification
inferred← citeshttps://doi.org/10.1007/s10601-004-5305-9openalex-snapshot
Solving Kirkman?s Schoolgirl Problem in a Few Seconds
inferred← citeshttps://doi.org/10.1007/s10601-004-5306-8openalex-snapshot
Symmetry Breaking Revisited
inferred← citeshttps://doi.org/10.1007/s10601-006-7095-8openalex-snapshot
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/s10601-006-9012-6openalex-snapshot
Cardinal: A Finite Sets Constraint Solver
inferred← citeshttps://doi.org/10.1007/s10601-007-9021-0openalex-snapshot
Generic Incremental Algorithms for Local Search
inferred← citeshttps://doi.org/10.1007/s10601-012-9138-7openalex-snapshot
Multiset variable representations and constraint propagation
inferred← citeshttps://doi.org/10.1007/s10601-021-09324-7openalex-snapshot
Global domain views for expressive and cross-domain constraint programming
inferred← citeshttps://doi.org/10.1007/s10732-007-9028-0openalex-snapshot
Enhancing set constraint solvers with lexicographic bounds
inferred← citeshttps://doi.org/10.1007/s10817-019-09520-4openalex-snapshot
Solving Quantifier-Free First-Order Constraints Over Finite Sets and Binary Relations
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.020openalex-snapshot
Lazy Constraint Imposing for Improving the Path Constraint
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.09.056openalex-snapshot
Enhancing set constraint solvers with bound consistency
inferred← citeshttps://doi.org/10.1016/j.ins.2013.05.030openalex-snapshot
A constraint propagation approach to structural model based image segmentation and recognition
inferred← citeshttps://doi.org/10.1016/j.istruc.2023.03.007openalex-snapshot
An effective nonlinear interval sequential quadratic programming method for uncertain inverse problems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100664openalex-snapshot
Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.042openalex-snapshot
Local consistency for extended CSPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.023openalex-snapshot
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10016-xopenalex-snapshot
Reasoning on constraints in CLP(FD)
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00063-1openalex-snapshot
Introduction to the constraint language NCL
inferred← citeshttps://doi.org/10.1016/s1364-8152(98)00098-xopenalex-snapshot
A cost-effective programmable environment for developing environmental decision support systems1This research is done under the support of TRACE INCO-COPERNICUS Project CP-960138, funded by the European Union within the ESPRIT programme.1
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80014-3openalex-snapshot
Symmetry in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80021-0openalex-snapshot
Constraints over Structured Domains
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03004-0openalex-snapshot
Chapter 4 Constraint Programming
inferred← citeshttps://doi.org/10.1017/s147106840500236xopenalex-snapshot
A CHR-based implementation of known arc-consistency
inferred← citeshttps://doi.org/10.1017/s1471068409003780openalex-snapshot
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
inferred← citeshttps://doi.org/10.1017/s1471068415000290openalex-snapshot
Adding partial functions to Constraint Logic Programming with sets
inferred← citeshttps://doi.org/10.1017/s1471068417000126openalex-snapshot
Contractibility for open global constraints
inferred← citeshttps://doi.org/10.1017/s1471068421000521openalex-snapshot
Integrating Cardinality Constraints into Constraint Logic Programming with Sets
inferred← citeshttps://doi.org/10.1023/a:1009894810205openalex-snapshot
Increasing Constraint Propagation by Redundant Modeling: an Experience Report
inferred← citeshttps://doi.org/10.1023/a:1011002911535openalex-snapshot
Subdefinite Models and Logic Programming: Implementation of Constraints
inferred← citeshttps://doi.org/10.1023/a:1024639523440openalex-snapshot
Configuration of Labeled Trees under Lexicalized Constraints and Principles
inferred← citeshttps://doi.org/10.1023/b:cons.0000006182.84033.6eopenalex-snapshot
Disunification in ACI1 Theories
inferred← citeshttps://doi.org/10.1093/comjnl/bxab195openalex-snapshot
Declarative Programming with Intensional Sets in Java Using JSetL
inferred← citeshttps://doi.org/10.1109/ase.1998.732620openalex-snapshot
Schema-guided synthesis of constraint logic programs
inferred← citeshttps://doi.org/10.1109/cse.2009.249openalex-snapshot
RBAC-Based Secure Interoperation Using Constraint Logic Programming
inferred← citeshttps://doi.org/10.1109/icstw.2011.30openalex-snapshot
Grey-Box Testing and Verification of Java/JML
inferred← citeshttps://doi.org/10.1109/ictai.2008.113openalex-snapshot
Stronger Consistencies in WCSPs with Set Variables
inferred← citeshttps://doi.org/10.1109/tai.2002.1180815openalex-snapshot
Automatic analysis of composite solvers
inferred← citeshttps://doi.org/10.1145/1057387.1057389openalex-snapshot
Dealing with incomplete knowledge on CLP( FD ) variable domains
inferred← citeshttps://doi.org/10.1145/1276920.1276925openalex-snapshot
Removing propagation redundant constraints in redundant modeling
inferred← citeshttps://doi.org/10.1145/1352582.1352583openalex-snapshot
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
inferred← citeshttps://doi.org/10.1145/1529282.1529594openalex-snapshot
Length-lex bound consistency for knapsack constraints
inferred← citeshttps://doi.org/10.1145/365151.365169openalex-snapshot
Sets and constraint logic programming
inferred← citeshttps://doi.org/10.1145/888251.888272openalex-snapshot
Integrating finite domain constraints and CLP with sets
inferred← citeshttps://doi.org/10.1145/963778.963779openalex-snapshot
An interval constraint system for lattice domains
inferred← citeshttps://doi.org/10.13140/rg.2.1.3885.0643openalex-snapshot
Constraint-Based Specifications for System Configuration
inferred← citeshttps://doi.org/10.1504/ijpd.2014.060037openalex-snapshot
Set-based design of mechanical systems with design robustness integrated
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7830openalex-snapshot
A Comparison of Lex Bounds for Multiset Variables in Constraint Programming
inferred← citeshttps://doi.org/10.1609/aaai.v26i2.18967openalex-snapshot
Applying Constraint Programming to Incorporate Engineering Methodologies into the Design Process of Complex Systems
inferred← citeshttps://doi.org/10.1613/jair.1638openalex-snapshot
Solving Set Constraint Satisfaction Problems using ROBDDs
inferred← citeshttps://doi.org/10.1613/jair.3014openalex-snapshot
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
inferred← citeshttps://doi.org/10.21105/joss.04708openalex-snapshot
Choco-solver: A Java library for constraint programming
inferred← citeshttps://doi.org/10.22028/d291-25771openalex-snapshot
Ressourcenoptimierung von Workflow Problemen
inferred← citeshttps://doi.org/10.3217/jucs-012-11-1466openalex-snapshot
An Interval Constraint Branching Scheme for Lattice Domains
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-505openalex-snapshot
Fast Set Bounds Propagation using BDDs
inferred← citeshttps://doi.org/10.3233/fi-2009-177openalex-snapshot
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
inferred← citeshttps://doi.org/10.4114/ia.v9i27.853openalex-snapshot
Declarative Constraint Programming
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.4230/lipics.cp.2023.26openalex-snapshot
Guiding Backtrack Search by Tracking Variables During Constraint Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2136openalex-snapshot
On the Cooperation of the Constraint Domains H, R and FD in CFLP
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0109060openalex-snapshot
Branching: the Essence of Constraint Solving
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302036openalex-snapshot
Constraint-based analysis of composite solvers
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608019openalex-snapshot
Relation Variables in Qualitative Spatial Reasoning
inferred← citeshttps://doi.org/10.5555/1782254.1782317openalex-snapshot
GRASPER: a framework for graph constraint satisfaction problems
inferred← citeshttps://doi.org/10.70675/4bd7f062z13ecz4bc2z80aazfd99a58b79fbopenalex-snapshot
Decomposition-based approaches for the design of energy efficient wireless sensor networks
inferred← citeshttps://doi.org/10.70675/95250d79z6211z4752zb64az3fa07526ff09openalex-snapshot
Méthodes exactes pour l'apprentissage de la structure d'un réseau bayésien et les réseaux de fonctions de coûts
inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP
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.