choco-solver
choco-solver copied to clipboard
chocoteam
An open-source Java library for Constraint Programming
Hi, I'm currently upgrading from Choco 2 to Choco 4. I used to manipulate very large FiniteAutomaton (aka DFA in Choco2), with more than 100.000 states. It used to work...
Since at_most and at_least are used to decompose, resp., all_equal and not_all_equal, in `IIntConstraintFactory`, wouldn't it be nice to avoid computing the union of variables domain when domains are very...
Hi, Is there a ready functionality in Choco that helps identifying constraint repairs in case of inconsistency? or depending on already calculated diagnoses? Thanks
Alexandre Papadopoulos suggests a few modifications to PropRegular in order to improve its overall behavior. 1. When the automaton is based on large alphabet, the graph initialization could be improved...
I'd expect any integer in the `` format in a FiniteAutomaton regex to parse that integer. But certain integers conflict with already-defined [operators](http://www.brics.dk/automaton/doc/index.html) and therefore cause the FiniteAutomaton constructor to...
``` java FiniteAutomaton(".") ``` hangs indefinitely. Probably because `.` means _any_ character, and a FiniteAutomaton's alphabet is finite. Though I'd at least assume something like this would be returned: ```...
ICF.regular() throws when I pass it an empty IntVar array: ``` clojure ArrayIndexOutOfBoundsException 0 org.chocosolver.solver.constraints.Propagator. (Propagator.java:140) ``` I assumed that if I passed in an empty array, the constraint would...
The Automaton class allows me to use letters in the regular expression, but then the `regular` constraint will constrain a var to be that character's ascii code _minus 7_. For...
Hi I plan to use cost_regular for a new project. The documentation of the signature is not very confortable. Especially in the CostAutomaton where there is no javadoc at all...
