If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

A customizable timetabling software for educational institutions that encodes timetabling constraints as a SAT formula and solves them using a MaxSAT solver ...

This project uses a Constraint Satisfaction Problem (CSP) and backtracking search to solve a road trip planning problem across the contiguous United States. Each node is a U.S. state (or D.C.), ...

Abstract: The coordination of fleet weapon compatibility is a typical constraint satisfaction problem based on multi-agent system. The conception of the most non-cooperation plan in fleet weapon ...

Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

Neural networks have emerged as a powerful framework for addressing complex problems across numerous scientific domains. In particular, the interplay between neural network models and constraint ...

In this section, a preference calculus based on order-of-magnitude reasoning is introduced and integrated into the activity-based dynamic constraint satisfaction problem (aDCSP) to form an aDCSP with ...