Constraint Propagation

Follow this topic Ask about this topic

Latest papers

10 papers0 papers in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.

Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem
Sep 8, 2026Dakshi Arora, Prakhar Kumar Srivastava, Ranjib BanerjeeConstraint Propagation Constraint Satisfaction
Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and its variants in Constraint Logic Programming
Aug 11, 2026Alessandro Bertagnon, Marco GavanelliTraveling Salesperson Problem Constraint Propagation
Department of Environmental and Prevention Sciences, University of Ferrara, Italy · Department of Engineering, University of Ferrara, Italy
SymStep: Symbolic Step Verification for Logical Reasoning
Jul 25, 2026Aida Usmanova, Rui Gao, Dilshod Azizov +2Constraint Propagation Symbolic Reasoning
Leuphana University of Lüneburg · Mohamed bin Zayed University of Artificial Intelligence
Global Difference Constraint Propagation for Constraint Programming
Jul 22, 2026Lucas Kletzander, Jip J. Dekker, Andreas Schutt +1Constraint Propagation Constraint Satisfaction
1Databases and Artificial Intelligence Group, TU Wien, Karlsplatz 13, Wien, 1040, Austria. · Department of Data Science and Artificial Intelligence, Monash University, Clayton, 3168, Victoria, Australia. · 3ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA), Melbourne, Victoria, Australia. +1
SEER: Supervised Learning to Control Energetic Reasoning
Jul 17, 2026Sascha Van Cauwelaert, Michele Lombardi, Pierre SchausConstraint Propagation Constraint Satisfaction
Universit´e Catholique de Louvain · Universit`a di Bologna
Agentic MIP Research: Accelerated Constraint Handler Generation
May 9, 2026Liding Xu, Yugeng Zhou, Sebastian PokuttaMixed-Integer Linear Programming Constraint Propagation
Zuse Institute Berlin, Berlin, Germany. · Independent Researcher. · Zuse Institute Berlin +1
Domain-Independent Dynamic Programming with Constraint Propagation
Mar 17, 2026Imko Marijnissen, J. Christopher Beck, Emir Demirović +1Resource-Constrained Project Scheduling Constraint Propagation
Delft University of Technology, The Netherlands · University of Toronto, Canada · National Institute of Informatics, Japan +1
On inferring cumulative constraints
Feb 17, 2026Konstantin SidorovResource-Constrained Project Scheduling Constraint Programming
Faculty of Electrical Engineering, Mathematics & Computer Science, Delft University of Technology, Delft, The Netherlands
Implementing Cumulative Functions with Generalized Cumulative Constraints
Aug 3, 2025Pierre Schaus, Charles Thomas, Roger KameugneConstraint Propagation Constraint Satisfaction
UCLouvain, ICTEAM, Louvain-la-Neuve, Belgium · University of Maroua, Maroua, Cameroon
A binarized-domains arc-consistency algorithm for TCSPs: its computational analysis and its use as a filtering procedure in solution search algorithms
Feb 22, 2020Amar IsliConstraint Satisfaction Temporal Consistency
University of Sciences and Technology Houari Boumedi`ene · Faculty of Computer Science · Department of Artiﬁcial Intelligence and Data Science +2

Sep 8, 2026J/K move · Enter open · S save

Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem

Dakshi Arora, Prakhar Kumar Srivastava, Ranjib Banerjee

Constraint Propagation Constraint Satisfaction Graph Reasoning

Open paper AskPDF arXiv

A feedback-based word deduction framework based on the Jotto problem is proposed, and the problem space is represented as a weighted graph where all valid words correspond to nodes, and the edge weight is defined by the number of common letters between the two words. Finally, the gameplay is defined as an iterative constraint propagation mechanism where feedback is used to iteratively narrow the incompatible space of the graph, facilitating the reduction of the hypothesis space in a structured and interpretable manner. In contrast to existing approaches, where the problem space is typically defined for fixed-length isograms, the proposed framework generalizes to variable-length words (between 3 and 8 letters) and naturally extends to repeated letter cases, facilitating the treatment of realistic Jotto problem instances within a unified framework for the first time. The proposed framework's applicability and solver dynamics are also discussed through an interactive implementation and a qualitative case study, respectively. Significant automated tests on approximately 3,000 simulated gameplay scenarios identify a novel convergence behavior: the expected number of iterations diminishes with increasing word length. A strong relationship is confirmed using statistical tests to verify a logarithmic relationship, which is also verified using regression modeling and goodness-of-fit tests. In addition to the initial problem statement, this formulation introduces graph pruning as a viable paradigm for feedback-driven inference with interpretability and its association with symbolic reasoning and interactive intelligent systems.