We present ‘NeuralConstraints,’ a suite of computer-assisted composition tools that integrates a feedforward neural network as a rule within a constraint-based composition framework.

Max has loved video games ever since he booted up his friend's N64 and played Mario Kart. He quickly spent all his allowance on any game he could get his hands on, and spent hours playing a dusty PS2.

Logical reasoning remains a crucial area where AI systems struggle despite advances in processing language and knowledge. Understanding logical reasoning in AI is essential for improving automated ...

Since the open-pit precedence-constrained production scheduling problem is an NP-hard problem, solving it is always a challenging task, especially from a long-term perspective because a mineral ...

This project is a simulation of a well known constraint satisfaction problem. It solves it in sudoku and n-queens games.

ABSTRACT: The phenomenon of phase transition in constraint satisfaction problems (CSPs) plays a crucial role in the field of artificial intelligence and computational complexity theory. In this paper, ...

Abstract: Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on theform of ...

An optaplanner planning problem related to satellites and tasks to assign to visibilities zones linked to that satellites. Used Quarkus and Constraint Streams. Tiny framework for solving constraint ...