On the public citation graph
An open-ended finite domain constraint solver
0 signed · 249 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-16492-8openalex-snapshot
Third International Conference on Logic Programming
inferredcites →https://doi.org/10.1007/3-540-59155-9_15openalex-snapshot
Design, implementation, and evaluation of the constraint language cc(FD)
inferredcites →https://doi.org/10.1007/3-540-59155-9_3openalex-snapshot
Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods
inferredcites →https://doi.org/10.1016/0004-3702(86)90083-4openalex-snapshot
Arc and path consistency revisited
inferredcites →https://doi.org/10.1016/0031-3203(76)90020-0openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0895-7177(93)90068-aopenalex-snapshot
Extending chip in order to solve complex scheduling and placement problems
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1016/0898-1221(95)90083-7openalex-snapshot
Logic programming: Proceedings of the eleventh international conference on logic programming
inferredcites →https://doi.org/10.1145/96709.96733openalex-snapshot
Concurrent constraint programming
inferredcites →https://doi.org/10.2307/2344667openalex-snapshot
Model Building in Mathematical Programming.
inferredcites →https://doi.org/10.2307/3009304openalex-snapshot
Model Building in Mathematical Programming
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0021openalex-snapshot
Compiling and Executing Disjunctions of Finite Domain Constraints
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0038openalex-snapshot
Entailment of Finite Domain Constraints
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0040openalex-snapshot
Improved CLP Scheduling with Task Intervals
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_20openalex-snapshot
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
inferred← citeshttps://doi.org/10.1007/11415763_10openalex-snapshot
Effective Modeling with Constraints
inferred← citeshttps://doi.org/10.1007/11754602_12openalex-snapshot
On Generators of Random Quasigroup Problems
inferred← citeshttps://doi.org/10.1007/11775331_4openalex-snapshot
Verification and Analysis of Organisational Change
inferred← citeshttps://doi.org/10.1007/11889205_41openalex-snapshot
Generating Propagators for Finite Set Constraints
inferred← citeshttps://doi.org/10.1007/11890584_9openalex-snapshot
Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_13openalex-snapshot
Modelling Resource Transitions in Constraint-Based Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-36388-2_16openalex-snapshot
A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises
inferred← citeshttps://doi.org/10.1007/3-540-36388-2_22openalex-snapshot
Solving Combinatorial Problems with a Constraint Functional Logic Language
inferred← citeshttps://doi.org/10.1007/3-540-36524-9_16openalex-snapshot
Action Rules for Programming Constraint Propagators and Interactive User Interfaces
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_13openalex-snapshot
A Finite Domain CLP Solver on Top of Mercury
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_6openalex-snapshot
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_6openalex-snapshot
Building Industrial Applications with Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_26openalex-snapshot
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_33openalex-snapshot
A CLP Approach to the Protein Side-Chain Placement Problem
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_53openalex-snapshot
Evaluation of Search Heuristics for Embedded System Scheduling Problems
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_54openalex-snapshot
Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching
inferred← citeshttps://doi.org/10.1007/3-540-45868-9_19openalex-snapshot
Interpreting Sloppy Stick Figures by Graph Rectification and Constraint-Based Matching
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-46016-0_21openalex-snapshot
Object-Oriented Constraint Programming with J.CP
inferred← citeshttps://doi.org/10.1007/3-540-46016-0_26openalex-snapshot
Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD)
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_36openalex-snapshot
Indexical-Based Solver Learning
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_5openalex-snapshot
A New Multi-resource cumulatives Constraint with Negative Heights
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_23openalex-snapshot
Constraint-Based Resource Allocation and Scheduling in Steel Manufacturing
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-1-4471-0651-7_24openalex-snapshot
A Constraint Functional Logic Language for Solving Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-20652-9_9openalex-snapshot
Automated Backend Selection for ProB Using Deep Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_31openalex-snapshot
Embedding High-Level Formal Specifications into Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-34968-4_15openalex-snapshot
Embedding SMT-LIB into B for Interactive Proof and Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-48077-6_8openalex-snapshot
Analysing ProB’s Constraint Solving Backends
inferred← citeshttps://doi.org/10.1007/978-3-030-58285-2_15openalex-snapshot
Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_41openalex-snapshot
RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-66494-7_4openalex-snapshot
Testing Industrial Robotic Systems: A New Battlefield!
inferred← citeshttps://doi.org/10.1007/978-3-030-71374-4_6openalex-snapshot
Prototyping Games Using Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-75775-5_4openalex-snapshot
Conditional Descriptor Revision and Its Modelling by a CSP
inferred← citeshttps://doi.org/10.1007/978-3-030-85248-1_7openalex-snapshot
Improving SMT Solver Integrations for the Validation of B and Event-B Models
inferred← citeshttps://doi.org/10.1007/978-3-031-25803-9_5openalex-snapshot
Towards Practical Partial Order Reduction for High-Level Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-031-35254-6_19openalex-snapshot
ProB: Harnessing the Power of Prolog to Bring Formal Models and Mathematics to Life
inferred← citeshttps://doi.org/10.1007/978-3-031-45608-4_17openalex-snapshot
Representing Nonmonotonic Inference Based on c-Representations as an SMT Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_13openalex-snapshot
Performance Fuzzing with Reinforcement-Learning and Well-Defined Constraints for the B Method
inferred← citeshttps://doi.org/10.1007/978-3-031-56940-1_10openalex-snapshot
Scaling up Nonmonotonic c-Inference via Partial MaxSAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-15981-6_6openalex-snapshot
Multi-configurable Search Rules in Prolog and Application to Testing
inferred← citeshttps://doi.org/10.1007/978-3-032-15981-6_9openalex-snapshot
Using Prolog to Translate Set Theory and B to SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_13openalex-snapshot
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_51openalex-snapshot
Domain Views for Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_6openalex-snapshot
Using CP in Automatic Test Generation for ABB Robotics’ Paint Control System
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_30openalex-snapshot
Model-Based Problem Solving for University Timetable Validation and Improvement
inferred← citeshttps://doi.org/10.1007/978-3-319-21215-9_9openalex-snapshot
A Constraint Optimisation Model for Analysis of Telecommunication Protocol Logs
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_15openalex-snapshot
From Failure to Proof: The ProB Disprover for B and Event-B
inferred← citeshttps://doi.org/10.1007/978-3-319-24644-4_8openalex-snapshot
Efficient Architecture-Level Configuration of Large-Scale Embedded Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-28228-2_1openalex-snapshot
Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station
inferred← citeshttps://doi.org/10.1007/978-3-319-33954-2openalex-snapshot
Integration of AI and OR Techniques in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-49815-7_1openalex-snapshot
Formal Model-Based Constraint Solving and Document Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-62569-0_4openalex-snapshot
Software Product Line Test Suite Reduction with Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_25openalex-snapshot
Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-73305-0_5openalex-snapshot
Three Is a Crowd: SAT, SMT and CLP on a Chessboard
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_3openalex-snapshot
Compilation of Conditional Knowledge Bases for Computing C-Inference Relations
inferred← citeshttps://doi.org/10.1007/978-3-319-91271-4_6openalex-snapshot
A Translation from Alloy to B
inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_20openalex-snapshot
Repair and Generation of Formal Models Using Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_45openalex-snapshot
Termination Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24627-5_3openalex-snapshot
Database Repair by Signed Formulae
inferred← citeshttps://doi.org/10.1007/978-3-540-24662-6_13openalex-snapshot
A New Approach to Modeling and Solving Minimal Perturbation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24662-6_14openalex-snapshot
Protein Folding in CLP(FD) with Empirical Contact Energies.
inferred← citeshttps://doi.org/10.1007/978-3-540-24662-6_3openalex-snapshot
Implementing Propagators for Tabular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-24662-6_5openalex-snapshot
Learning Approximate Consistencies
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_18openalex-snapshot
A Global Constraint for Nesting Problems
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-25945-9_36openalex-snapshot
Generating Random Orthogonal Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-25957-2_28openalex-snapshot
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_34openalex-snapshot
Protein Folding Simulation in CCP
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_15openalex-snapshot
A Lower-Bound Algorithm for Load Balancing in Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28646-2_15openalex-snapshot
Integrating ACO and Constraint Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_11openalex-snapshot
Deriving Filtering Algorithms from Constraint Checkers
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_45openalex-snapshot
Speeding Up Constraint Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_56openalex-snapshot
Abductive Logic Programming with CIFF: System Description
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_6openalex-snapshot
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-39592-8_51openalex-snapshot
Extending the CLP Engine for Reasoning under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-540-45157-0_21openalex-snapshot
University Course Timetabling with Soft Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_53openalex-snapshot
clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-45217-1_10openalex-snapshot
GraniteNights – A Multi-agent Visit Scheduler Utilising Semantic Web Technology
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_46openalex-snapshot
ProB: A Model Checker for B
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_19openalex-snapshot
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_30openalex-snapshot
Advisors for Incremental Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_40openalex-snapshot
Boosting Probabilistic Choice Operators
inferred← citeshttps://doi.org/10.1007/978-3-540-78295-7_6openalex-snapshot
Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_15openalex-snapshot
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
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-89982-2_69openalex-snapshot
Compiling and Executing Declarative Modeling Languages to Gecode
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_89openalex-snapshot
Generalising Constraint Solving over Finite Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-92243-8_2openalex-snapshot
A Flexible Search Framework for CHR
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_54openalex-snapshot
Maintaining State in Propagation Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_14openalex-snapshot
Sweeping with Continuous Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_43openalex-snapshot
Global Constraints on Feature Models
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_49openalex-snapshot
A Safe and Flexible CP-Based Approach for Velocity Tuning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-15579-6_20openalex-snapshot
Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-20589-7_14openalex-snapshot
Network Monitoring with Constraint Programming: Preliminary Specification and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_33openalex-snapshot
Industrial-Size Scheduling with ASP+CP
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_23openalex-snapshot
Half Reification and Flattening
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_24openalex-snapshot
The Finite Domain Constraint Solver of SWI-Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_2openalex-snapshot
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-31491-9_18openalex-snapshot
Model-Based Automated and Guided Configuration of Embedded Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31727-9_1openalex-snapshot
The Painting Fool: Stories from Building an Automated Painter
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_40openalex-snapshot
Towards Solver-Independent Propagators
inferred← citeshttps://doi.org/10.1007/978-3-642-37057-1_14openalex-snapshot
Scenario Realizability with Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-38916-0_1openalex-snapshot
Incremental Refinement Checking for Test Case Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_10openalex-snapshot
A Declarative Approach for Computing Ordinal Conditional Functions Using Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-43652-3_8openalex-snapshot
Towards B as a High-Level Constraint Modelling Language
inferred← citeshttps://doi.org/10.1007/978-3-662-44857-1_10openalex-snapshot
Testing Robotized Paint System Using Constraint Programming: An Industrial Case Study
inferred← citeshttps://doi.org/10.1007/b95342openalex-snapshot
Foundations of information and knowledge systems : third International Symposium, FoIKS 2004 : Wilheminenburg Castle, Austria, February 17-20, 2004 : proceedings
inferred← citeshttps://doi.org/10.1007/s00165-010-0172-1openalex-snapshot
Automated property verification for large scale B models with ProB
inferred← citeshttps://doi.org/10.1007/s00165-018-0461-7openalex-snapshot
Model-based problem solving for university timetable validation and improvement
inferred← citeshttps://doi.org/10.1007/s10009-007-0063-9openalex-snapshot
ProB: an automated analysis toolset for the B method
inferred← citeshttps://doi.org/10.1007/s10009-022-00682-yopenalex-snapshot
SMT solving for the validation of B and Event-B models
inferred← citeshttps://doi.org/10.1007/s10441-013-9169-5openalex-snapshot
Formal Methods for Hopfield-Like Networks
inferred← citeshttps://doi.org/10.1007/s10458-007-9024-7openalex-snapshot
Organisational change through influence
inferred← citeshttps://doi.org/10.1007/s10462-009-9120-yopenalex-snapshot
A global constraint for nesting problems
inferred← citeshttps://doi.org/10.1007/s10472-005-9012-zopenalex-snapshot
Computational methods for database repair by signed formulae*
inferred← citeshttps://doi.org/10.1007/s10472-017-9571-9openalex-snapshot
Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem
inferred← citeshttps://doi.org/10.1007/s10472-019-09653-7openalex-snapshot
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
inferred← citeshttps://doi.org/10.1007/s10472-021-09746-2openalex-snapshot
Ranking kinematics for revising by contextual information
inferred← citeshttps://doi.org/10.1007/s10479-007-0218-9openalex-snapshot
Towards constraint-based school timetabling
inferred← citeshttps://doi.org/10.1007/s10479-010-0683-4openalex-snapshot
Global propagation of side constraints for solving over-constrained problems
inferred← citeshttps://doi.org/10.1007/s10601-005-2809-xopenalex-snapshot
Reformulation of Global Constraints Based on Constraints Checkers
inferred← citeshttps://doi.org/10.1007/s10601-012-9133-zopenalex-snapshot
View-based propagator derivation
inferred← citeshttps://doi.org/10.1007/s10601-013-9151-5openalex-snapshot
Propagation engine prototyping with a domain specific language
inferred← citeshttps://doi.org/10.1007/s10601-014-9172-8openalex-snapshot
Synchronized sweep algorithms for scalable scheduling constraints
inferred← citeshttps://doi.org/10.1007/s10601-017-9270-5openalex-snapshot
Auto-tabling for subproblem presolving in MiniZinc
inferred← citeshttps://doi.org/10.1007/s10601-024-09368-5openalex-snapshot
Applying constraint programming to minimal lottery designs
inferred← citeshttps://doi.org/10.1007/s10703-020-00351-3openalex-snapshot
Integrating formal specifications into applications: the ProB Java API
inferred← citeshttps://doi.org/10.1007/s13218-016-0453-9openalex-snapshot
A Practical Comparison of Qualitative Inferences with Preferred Ranking Models
inferred← citeshttps://doi.org/10.1016/bs.adcom.2015.11.004openalex-snapshot
Recent Advances in Model-Based Testing
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103489openalex-snapshot
Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.039openalex-snapshot
Automatic Implication Checking for CHR Constraints
inferred← citeshttps://doi.org/10.1016/j.ijar.2007.08.003openalex-snapshot
Specifying and reasoning about uncertain agents
inferred← citeshttps://doi.org/10.1016/j.infsof.2006.10.016openalex-snapshot
Goal-oriented test data generation for pointer programs
inferred← citeshttps://doi.org/10.1016/j.infsof.2014.09.009openalex-snapshot
Testing robot controllers using constraint programming and continuous integration
inferred← citeshttps://doi.org/10.1016/j.ins.2004.11.007openalex-snapshot
Communicating sequential processes for distributed constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.jal.2010.07.001openalex-snapshot
Simplified forms of computerized reasoning with distance semantics
inferred← citeshttps://doi.org/10.1016/j.scico.2012.06.004openalex-snapshot
From extended feature models to constraint logic programming
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.004openalex-snapshot
Model-based mutation testing via symbolic refinement checking
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.013openalex-snapshot
Theory propagation and reification
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.001openalex-snapshot
Architecture-level configuration of industrial control systems: Foundations for an efficient approach
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102378openalex-snapshot
Translating Alloy and extensions to classical B
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.042openalex-snapshot
Formal analysis of PIN block attacks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.024openalex-snapshot
A pearl on SAT and SMT solving in Prolog
inferred← citeshttps://doi.org/10.1016/s0097-8485(01)00103-6openalex-snapshot
Modelling protein side-chain conformations using constraint logic programming
inferred← citeshttps://doi.org/10.1016/s0893-9659(02)00071-xopenalex-snapshot
A constraint logic programming approach for generating all perfect matchings
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80018-0openalex-snapshot
Finite Domain Constraint Programming Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s0269888912000215openalex-snapshot
Constraint programming for air traffic management: a survey
inferred← citeshttps://doi.org/10.1017/s0269888912000252openalex-snapshot
TCAS software verification using constraint programming
inferred← citeshttps://doi.org/10.1017/s1471068405002590openalex-snapshot
Programming finite-domain constraint propagators in Action Rules
inferred← citeshttps://doi.org/10.1017/s1471068406002924openalex-snapshot
Constraint functional logic programming over finite domains
inferred← citeshttps://doi.org/10.1017/s1471068411000299openalex-snapshot
Constraint-based deadlock checking of high-level specifications
inferred← citeshttps://doi.org/10.1017/s1471068411000482openalex-snapshot
SICStus Prolog—The first 25 years
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.1023/a:1021805623454openalex-snapshot
Dynamic Global Constraints in Backtracking Based Environments
inferred← citeshttps://doi.org/10.1023/b:cons.0000006181.40558.37openalex-snapshot
On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's “A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains”
inferred← citeshttps://doi.org/10.1080/08839510500479496openalex-snapshot
CRAFTING THE MIND OF PROSOCS AGENTS
inferred← citeshttps://doi.org/10.1109/4235.887235openalex-snapshot
A hybrid evolutionary approach for solving constrained optimization problems over finite domains
inferred← citeshttps://doi.org/10.1109/aitest.2019.00014openalex-snapshot
Stress Testing of Single-Arm Robots Through Constraint-Based Generation of Continuous Trajectories
inferred← citeshttps://doi.org/10.1109/cmpsac.2003.1245319openalex-snapshot
Automated metamorphic testing
inferred← citeshttps://doi.org/10.1109/compsac.2005.81openalex-snapshot
Goal-Oriented Test Data Generation for Programs with Pointer Variables
inferred← citeshttps://doi.org/10.1109/icsess.2013.6615321openalex-snapshot
Failure handling of E-Business Services in an extensible constraint service model
inferred← citeshttps://doi.org/10.1109/icst.2012.169openalex-snapshot
Towards Symbolic Model-Based Mutation Testing: Pitfalls in Expressing Semantics as Constraints
inferred← citeshttps://doi.org/10.1109/ictai.2013.160openalex-snapshot
Generation of Implied Constraints for Automaton-Induced Decompositions
inferred← citeshttps://doi.org/10.1109/ictai.2017.00027openalex-snapshot
Automatic Generation of Descriptions of Time-Series Constraints
inferred← citeshttps://doi.org/10.1109/ictai.2018.00026openalex-snapshot
Stratified Constructive Disjunction and Negation in Constraint Programming
inferred← citeshttps://doi.org/10.1109/isda.2009.116openalex-snapshot
Optimizing Allocation in Floor Storage Systems for the Shoe Industry by Constraint Logic Programming
inferred← citeshttps://doi.org/10.1109/issre.2007.34openalex-snapshot
Improving Constraint-Based Testing with Dynamic Linear Relaxations
inferred← citeshttps://doi.org/10.1109/modeva.2004.1425844openalex-snapshot
An ongoing work on statistical structural testing via probabilistic concurrent constraint programming
inferred← citeshttps://doi.org/10.1109/qsic.2012.58openalex-snapshot
Efficient Refinement Checking for Model-Based Mutation Testing
inferred← citeshttps://doi.org/10.1109/sere.2012.32openalex-snapshot
µTIL: Mutation-based Statistical Test Inputs Generation for Automatic Fault Localization
inferred← citeshttps://doi.org/10.1109/services.2012.36openalex-snapshot
Contracting of Web Services with Constraint Handling Rules
inferred← citeshttps://doi.org/10.1109/skg.2011.12openalex-snapshot
Contracting of E-business Services in a Constraint-Based Process Modeling Framework
inferred← citeshttps://doi.org/10.1109/sti50764.2020.9350485openalex-snapshot
Automated Large-scale Class Scheduling in MiniZinc
inferred← citeshttps://doi.org/10.1109/tc.2016.2529629openalex-snapshot
Multicore-Aware Virtual Machine Placement in Cloud Data Centers
inferred← citeshttps://doi.org/10.1109/tsmcb.2003.817048openalex-snapshot
Sensor Scheduling in Mobile Robots Using Incomplete Information via Min-Conflict With Happiness
inferred← citeshttps://doi.org/10.1109/waina.2011.155openalex-snapshot
Determination, Optimization and Taxonomy of Regulatory Networks: The Example of Arabidopsis thaliana Flower Morphogenesis
inferred← citeshttps://doi.org/10.1111/1475-3995.00434openalex-snapshot
Solving nesting problems with non‐convex polygons by constraint logic programming
inferred← citeshttps://doi.org/10.1117/12.450718openalex-snapshot
Handling ambiguity in constraint-based recognition of stick figure sketches
inferred← citeshttps://doi.org/10.1145/1069774.1069796openalex-snapshot
Heuristics, optimizations, and parallelism for protein structure prediction in CLP( FD )
inferred← citeshttps://doi.org/10.1145/1088622.1088634openalex-snapshot
Knowledge base reuse through constraint relaxation
inferred← citeshttps://doi.org/10.1145/1273920.1273924openalex-snapshot
User-definable rule priorities for CHR
inferred← citeshttps://doi.org/10.1145/1389449.1389450openalex-snapshot
Declarative programming for verification
inferred← citeshttps://doi.org/10.1145/1411260.1411271openalex-snapshot
Declarative language extensions for prolog courses
inferred← citeshttps://doi.org/10.1145/1452044.1452046openalex-snapshot
Efficient constraint propagation engines
inferred← citeshttps://doi.org/10.1145/2505879.2505901openalex-snapshot
Theory propagation and rational-trees
inferred← citeshttps://doi.org/10.1145/2581376openalex-snapshot
Architecture-Level Configuration of Large-Scale Embedded Software Systems
inferred← citeshttps://doi.org/10.1145/2610384.2610416openalex-snapshot
FLOWER: optimal test suite reduction as a network maximum flow
inferred← citeshttps://doi.org/10.1145/2642937.2642971openalex-snapshot
Scaling exact multi-objective combinatorial optimization by parallelization
inferred← citeshttps://doi.org/10.1145/963778.963779openalex-snapshot
An interval constraint system for lattice domains
inferred← citeshttps://doi.org/10.11606/d.55.2017.tde-21092017-144848openalex-snapshot
Estudo de métodos de solução para problemas de corte de itens irregulares em recipientes irregulares
inferred← citeshttps://doi.org/10.1201/9780203496299.ch13openalex-snapshot
The Software Development Infrastructure
showing the first 200 of 234 · page through all 234
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.