JuliaConstraints / JuliaConstraints/ConstraintProgrammingExtensions.jl
Benchmark Disjunction
Open
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 24
- Forks
- 2
- PR merge metrics
- No merged PRs in 30d
Description
As discussed during the JuliaCon, a recursive approach (i.e. disjunction only between two constraints) could solve some issues. But benchmarking is required.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file or benchmark entry point is named. Start by locating the current disjunction implementation and existing benchmark setup, then compare it with a recursive approach limited to two constraints. Done means the benchmark results clearly show whether the recursive approach resolves the identified issues.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100