Kiwi - A Minimalist CP Solver
Kiwi is a minimalist and extendable Constraint Programming (CP) solver specifically designed for education. The particularities of Kiwi stand in its generic trailing state restoration mechanism and its modulable use of variables. By developing Kiwi, the author does not aim to provide an alternative to full featured constraint solvers but rather to provide readers with a basic architecture that will (hopefully) help them to understand the core mechanisms hidden under the hood of constraint solvers, to develop their own extended constraint solver, or to test innovative ideas.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Inferring Minimalist Grammars with an SMT-Solver
Incremental Acquisition of a Minimalist Grammar using an SMT-Solver
Automatic Inference of Minimalist Grammars using an SMT-Solver
We introduce (1) a novel parser for Minimalist Grammars (MG), encoded as a system of first-order logic formulae that may be evaluated using an SMT-solver, and (2) a novel procedure for inferring Minimalist Grammars using…
SentenceOpenKiwi: An Open Source Framework for Quality Estimation
We introduce OpenKiwi, a PyTorch-based open source framework for translation quality estimation. OpenKiwi supports training and testing of word-level and sentence-level quality estimation systems, implementing the winnin…
NMTSentenceTranslationRobots for Kiwifruit Harvesting and Pollination
This research was a part of a project that developed mobile robots that performed targeted pollen spraying and automated harvesting in pergola structured kiwifruit orchards. Multiple kiwifruit detachment mechanisms were …
Autonomous DrivingRobot Navigation