pyomo-cp 0.1.0__tar.gz

pyomo_cp-0.1.0/.github/workflows/ci.yml

@@ -0,0 +1,23 @@
+name: ci
+
+on:
+  push:
+    branches: [main]
+  pull_request:
+
+jobs:
+  test:
+    runs-on: ubuntu-latest
+    strategy:
+      fail-fast: false
+      matrix:
+        python-version: ["3.10", "3.11", "3.12"]
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-python@v5
+        with:
+          python-version: ${{ matrix.python-version }}
+      - name: Install
+        run: pip install -e ".[dev]"
+      - name: Test
+        run: pytest -q

pyomo_cp-0.1.0/.github/workflows/publish.yml

@@ -0,0 +1,26 @@
+name: publish
+
+# Publishes to PyPI on a version tag (e.g. `git tag v0.1.0 && git push --tags`).
+# Uses PyPI Trusted Publishing (OIDC) -- no API token needed, but the project
+# must be configured for trusted publishing on PyPI first (one-time setup).
+
+on:
+  push:
+    tags: ["v*"]
+
+jobs:
+  build-and-publish:
+    runs-on: ubuntu-latest
+    permissions:
+      id-token: write  # required for trusted publishing
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-python@v5
+        with:
+          python-version: "3.12"
+      - name: Build sdist and wheel
+        run: |
+          python -m pip install --upgrade build
+          python -m build
+      - name: Publish to PyPI
+        uses: pypa/gh-action-pypi-publish@release/v1

pyomo_cp-0.1.0/.gitignore

@@ -0,0 +1,20 @@
+# Python
+__pycache__/
+*.py[cod]
+*.egg-info/
+.eggs/
+build/
+dist/
+.pytest_cache/
+.mypy_cache/
+.ruff_cache/
+
+# Environments
+.venv/
+venv/
+env/
+
+# Editors / OS
+.vscode/
+.idea/
+.DS_Store

pyomo_cp-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

pyomo_cp-0.1.0/NOTICE

@@ -0,0 +1,14 @@
+pyomo-cp
+Copyright 2026 Devin Griffith
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

pyomo_cp-0.1.0/PKG-INFO

@@ -0,0 +1,116 @@
+Metadata-Version: 2.4
+Name: pyomo-cp
+Version: 0.1.0
+Summary: Constraint-programming backends for Pyomo: a discretization transform plus CP solver interfaces (CP-SAT first).
+Project-URL: Homepage, https://github.com/devin-griff/pyomo-cp
+Project-URL: Repository, https://github.com/devin-griff/pyomo-cp
+Author-email: Devin Griffith <dwg176@gmail.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: constraint-programming,cp-sat,gdp,optimization,or-tools,pyomo
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.9
+Requires-Dist: pyomo>=6.7
+Provides-Extra: cpsat
+Requires-Dist: ortools>=9.7; extra == 'cpsat'
+Provides-Extra: dev
+Requires-Dist: ortools>=9.7; extra == 'dev'
+Requires-Dist: pytest; extra == 'dev'
+Description-Content-Type: text/markdown
+
+# pyomo-cp
+
+Constraint-programming backends for [Pyomo](https://www.pyomo.org/): a
+discretization transform plus CP solver interfaces, starting with
+[CP-SAT](https://developers.google.com/optimization/cp/cp_solver) (OR-Tools).
+
+Pyomo can build and solve disjunctive/logical models via `pyomo.gdp`, but it can
+only *solve* them by reformulating to MILP/MINLP (big-M, hull) and calling a MIP
+solver. `pyomo-cp` adds the missing path: take the same model and solve it with a
+constraint-programming solver, where disjunctions map to native reified
+constraints instead of being reformulated.
+
+> **Status: alpha.** Integer models, `pyomo.gdp` disjunctions, logical
+> constraints / Boolean variables, and discretization of continuous variables
+> (any `step`) work end-to-end via `SolverFactory('cpsat')`. Global constraints
+> are not yet supported. See [ROADMAP.md](ROADMAP.md).
+
+## Scope
+
+`pyomo-cp` is a **backend framework**, not a full CP modelling frontend. It
+translates what Pyomo can already express:
+
+- integer and (once discretized) continuous variables,
+- linear constraints and a linear objective,
+- logical constraints (`BooleanVar` / `LogicalConstraint`),
+- `pyomo.gdp` disjunctions.
+
+**Global constraints** (`alldifferent`, `no_overlap`, `element`, `cumulative`,
+...) are the heart of CP's modelling power, and Pyomo has no vocabulary for
+them. Adding one is roadmap, not part of the initial scope.
+
+CP solvers are finite-domain, so continuous variables must be discretized first.
+That is an **explicit** step (`TransformationFactory('cp.discretize')`), never
+automatic, because the integrality assumption is a modelling decision that
+changes the problem.
+
+## Relationship to `pyomo.contrib.cp`
+
+Pyomo ships an in-tree constraint-programming module, `pyomo.contrib.cp`. It is a
+different tool for a different job, and the two are complementary:
+
+| | `pyomo.contrib.cp` | this package |
+|---|---|---|
+| Role | CP **frontend** | CP **backend** |
+| Built for | scheduling: `IntervalVar`, sequence vars, `Pulse` / step functions, precedence | solving models Pyomo already expresses — no new constructs |
+| Input | a CP model written with the interval API | an existing `pyomo.gdp` / integer / logical model |
+| Continuous variables | none (finite-domain only) | explicit `cp.discretize` onto a grid |
+| Solver | IBM CP Optimizer (commercial, via `docplex`) | CP-SAT / OR-Tools (open-source) |
+
+In one line: `pyomo.contrib.cp` is *write an interval/scheduling model and solve
+it with CP Optimizer*; this package is *take a disjunctive/integer model you'd
+otherwise reformulate to MILP and solve it (optionally discretized) with CP-SAT*.
+They overlap only on logical constraints; the paradigm (interval scheduling vs
+disjunctive/geometric) and the solver (commercial vs open) otherwise differ.
+
+## Install
+
+```bash
+pip install "pyomo-cp[cpsat]"   # includes OR-Tools for the CP-SAT backend
+```
+
+## Usage
+
+```python
+import pyomo.environ as pyo
+from pyomo.gdp import Disjunct, Disjunction
+import pyomo_cp  # registers cp.discretize and the cpsat solver
+
+# Two boxes (lengths 2 and 3) that must not overlap on a line; minimize extent.
+m = pyo.ConcreteModel()
+m.x1 = pyo.Var(bounds=(0, 10))          # continuous positions
+m.x2 = pyo.Var(bounds=(0, 10))
+m.L = pyo.Var(bounds=(0, 10))
+m.e1 = pyo.Constraint(expr=m.L >= m.x1 + 2)
+m.e2 = pyo.Constraint(expr=m.L >= m.x2 + 3)
+m.d1 = Disjunct(); m.d1.c = pyo.Constraint(expr=m.x1 + 2 <= m.x2)  # box1 left of box2
+m.d2 = Disjunct(); m.d2.c = pyo.Constraint(expr=m.x2 + 3 <= m.x1)  # box2 left of box1
+m.no = Disjunction(expr=[m.d1, m.d2])
+m.obj = pyo.Objective(expr=m.L)
+
+pyo.TransformationFactory("cp.discretize").apply_to(m)      # explicit; unit grid
+res = pyo.SolverFactory("cpsat").solve(m, time_limit=10)
+print(res.solver.termination_condition, pyo.value(m.obj))  # optimal 5.0
+```
+
+Solver options are passed as friendly aliases (`time_limit`, `workers`, `seed`,
+`gap`) or as raw CP-SAT parameter names via `options={...}`, e.g.
+`solve(m, workers=8, options={"log_search_progress": True})`.
+
+## License
+
+Apache License 2.0. See [LICENSE](LICENSE).

pyomo_cp-0.1.0/README.md

@@ -0,0 +1,92 @@
+# pyomo-cp
+
+Constraint-programming backends for [Pyomo](https://www.pyomo.org/): a
+discretization transform plus CP solver interfaces, starting with
+[CP-SAT](https://developers.google.com/optimization/cp/cp_solver) (OR-Tools).
+
+Pyomo can build and solve disjunctive/logical models via `pyomo.gdp`, but it can
+only *solve* them by reformulating to MILP/MINLP (big-M, hull) and calling a MIP
+solver. `pyomo-cp` adds the missing path: take the same model and solve it with a
+constraint-programming solver, where disjunctions map to native reified
+constraints instead of being reformulated.
+
+> **Status: alpha.** Integer models, `pyomo.gdp` disjunctions, logical
+> constraints / Boolean variables, and discretization of continuous variables
+> (any `step`) work end-to-end via `SolverFactory('cpsat')`. Global constraints
+> are not yet supported. See [ROADMAP.md](ROADMAP.md).
+
+## Scope
+
+`pyomo-cp` is a **backend framework**, not a full CP modelling frontend. It
+translates what Pyomo can already express:
+
+- integer and (once discretized) continuous variables,
+- linear constraints and a linear objective,
+- logical constraints (`BooleanVar` / `LogicalConstraint`),
+- `pyomo.gdp` disjunctions.
+
+**Global constraints** (`alldifferent`, `no_overlap`, `element`, `cumulative`,
+...) are the heart of CP's modelling power, and Pyomo has no vocabulary for
+them. Adding one is roadmap, not part of the initial scope.
+
+CP solvers are finite-domain, so continuous variables must be discretized first.
+That is an **explicit** step (`TransformationFactory('cp.discretize')`), never
+automatic, because the integrality assumption is a modelling decision that
+changes the problem.
+
+## Relationship to `pyomo.contrib.cp`
+
+Pyomo ships an in-tree constraint-programming module, `pyomo.contrib.cp`. It is a
+different tool for a different job, and the two are complementary:
+
+| | `pyomo.contrib.cp` | this package |
+|---|---|---|
+| Role | CP **frontend** | CP **backend** |
+| Built for | scheduling: `IntervalVar`, sequence vars, `Pulse` / step functions, precedence | solving models Pyomo already expresses — no new constructs |
+| Input | a CP model written with the interval API | an existing `pyomo.gdp` / integer / logical model |
+| Continuous variables | none (finite-domain only) | explicit `cp.discretize` onto a grid |
+| Solver | IBM CP Optimizer (commercial, via `docplex`) | CP-SAT / OR-Tools (open-source) |
+
+In one line: `pyomo.contrib.cp` is *write an interval/scheduling model and solve
+it with CP Optimizer*; this package is *take a disjunctive/integer model you'd
+otherwise reformulate to MILP and solve it (optionally discretized) with CP-SAT*.
+They overlap only on logical constraints; the paradigm (interval scheduling vs
+disjunctive/geometric) and the solver (commercial vs open) otherwise differ.
+
+## Install
+
+```bash
+pip install "pyomo-cp[cpsat]"   # includes OR-Tools for the CP-SAT backend
+```
+
+## Usage
+
+```python
+import pyomo.environ as pyo
+from pyomo.gdp import Disjunct, Disjunction
+import pyomo_cp  # registers cp.discretize and the cpsat solver
+
+# Two boxes (lengths 2 and 3) that must not overlap on a line; minimize extent.
+m = pyo.ConcreteModel()
+m.x1 = pyo.Var(bounds=(0, 10))          # continuous positions
+m.x2 = pyo.Var(bounds=(0, 10))
+m.L = pyo.Var(bounds=(0, 10))
+m.e1 = pyo.Constraint(expr=m.L >= m.x1 + 2)
+m.e2 = pyo.Constraint(expr=m.L >= m.x2 + 3)
+m.d1 = Disjunct(); m.d1.c = pyo.Constraint(expr=m.x1 + 2 <= m.x2)  # box1 left of box2
+m.d2 = Disjunct(); m.d2.c = pyo.Constraint(expr=m.x2 + 3 <= m.x1)  # box2 left of box1
+m.no = Disjunction(expr=[m.d1, m.d2])
+m.obj = pyo.Objective(expr=m.L)
+
+pyo.TransformationFactory("cp.discretize").apply_to(m)      # explicit; unit grid
+res = pyo.SolverFactory("cpsat").solve(m, time_limit=10)
+print(res.solver.termination_condition, pyo.value(m.obj))  # optimal 5.0
+```
+
+Solver options are passed as friendly aliases (`time_limit`, `workers`, `seed`,
+`gap`) or as raw CP-SAT parameter names via `options={...}`, e.g.
+`solve(m, workers=8, options={"log_search_progress": True})`.
+
+## License
+
+Apache License 2.0. See [LICENSE](LICENSE).

pyomo_cp-0.1.0/ROADMAP.md

@@ -0,0 +1,92 @@
+# pyomo-cp roadmap
+
+The v0.1 goal: a user writes a `pyomo.gdp` model, applies `cp.discretize`, calls
+`SolverFactory('cpsat').solve(m)`, and gets the correct optimum, validated
+against an independent hand-written CP-SAT model and against Gurobi/MILP.
+
+## Guiding principles
+
+- **Backend framework, not a CP frontend.** Translate what Pyomo can already
+  express; global-constraint modelling is out of scope for v0.
+- **Oracle-tested.** Every translation is validated by solving the same model two
+  independent ways and asserting identical optima.
+- **Don't over-abstract.** Build CP-SAT as a direct emitter with a clean seam.
+  Introduce a solver-agnostic IR only when a second backend forces it.
+- **Discretization is explicit and general.** A first-class, solver-agnostic
+  transform the user applies knowingly; backends never discretize silently.
+
+## Scope contract (v0.1)
+
+Supported: integer/continuous-bounded `Var`; linear `Constraint`; linear
+`Objective`; `pyomo.gdp` `Disjunction`/`Disjunct`; `LogicalConstraint`/
+`BooleanVar`. Requires all variables bounded and data integer-scalable (exact) or
+discretized (approximate, declared `step`). Must error clearly on: nonlinear
+expressions, unbounded variables, global constraints.
+
+## Phase 0 — Scaffolding (done)
+
+Repo, `src/pyomo_cp/` layout, `pyproject.toml` (Apache-2.0), stub
+`cp.discretize` transform and `cpsat` solver, CI skeleton.
+**Acceptance:** `pip install -e .` works; importing `pyomo_cp` registers
+`SolverFactory('cpsat')` and `TransformationFactory('cp.discretize')`.
+
+## Phase 1 — CP-SAT backend for already-integer models
+
+Model walker over `Var`/`Constraint`/`Objective`; linear extraction via
+`generate_standard_repn` (reject nonlinear with a clear error); emit
+`NewIntVar`/`NewBoolVar`, `m.Add(...)`, `Minimize`/`Maximize`; solve wrapper
+(time limit, workers, seed), status mapping, solution load-back, Pyomo results
+object.
+**Acceptance:** a small pure-integer model solves via `cpsat` and matches Gurobi.
+
+## Phase 2 — Disjunctions and logic
+
+`Disjunction` -> one indicator `BoolVar` per `Disjunct`, disjunct constraints
+under `OnlyEnforceIf`, `AddExactlyOne`/`AddAtMostOne` per semantics (nested
+handled recursively). `LogicalConstraint`/`BooleanVar` -> CP-SAT boolean
+constraints.
+**Acceptance:** a small disjunctive integer model matches its Gurobi (bigm/hull)
+optimum.
+
+## Phase 3 — Discretization transform
+
+`cp.discretize`: bounded continuous `Var` -> integer `x_int` with
+`x = lb + step*x_int`; substitute; scale coefficients to integers (exact for
+integer data, warn/round otherwise); **preserve disjunctions**; descale on
+load-back; per-variable `step`.
+**Acceptance (headline milestone):** a `pyomo.gdp` layout model, discretized and
+solved with `cpsat`, reproduces the hand-written CP-SAT optima on the benchmark
+instances and equals the Gurobi optima. This is the "one GDP model, two solvers"
+demonstration.
+
+## Phase 4 — Hardening + release v0.1
+
+Clear errors for unsupported constructs; solver-option passthrough; README
+example; docs on scope and the discretization contract; green CI matrix; PyPI
+trusted-publishing on tag; `v0.1.0`.
+
+## Cross-cutting
+
+- **Testing:** oracle tests (vs hand CP-SAT and vs Gurobi) plus property tests
+  (random small models solved both ways with equal optima). Test solution
+  *values*, not just objectives.
+- **Version drift:** CI-pin ortools/pyomo; the interface is what breaks on their
+  releases.
+
+## Post-v0 (future)
+
+1. **MiniZinc/FlatZinc emitter** — reaches Chuffed/Gecode/etc.; a very different
+   target than CP-SAT's API, so it's what forces and validates a real IR. Factor
+   the IR here, not before.
+2. **Global-constraint vocabulary** — modelling components (`AllDifferent`,
+   `NoOverlap`, `Element`, `Cumulative`) mapped to CP-SAT and MiniZinc globals;
+   includes recognizing a GDP no-overlap pattern to emit `AddNoOverlap2D`. This
+   is the "backend framework -> CP frontend" leap and effectively its own
+   project.
+3. **CP Optimizer backend** (docplex), once the IR exists.
+4. **Ergonomics:** warm starts, search hints, portfolio/worker config.
+
+## Open decisions
+
+- Introduce the solver-agnostic IR at Phase 5 (MiniZinc), not before.
+- License: Apache-2.0 (chosen: permissive, patent grant, matches OR-Tools).

pyomo_cp-0.1.0/pyproject.toml

@@ -0,0 +1,36 @@
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[project]
+name = "pyomo-cp"
+version = "0.1.0"
+description = "Constraint-programming backends for Pyomo: a discretization transform plus CP solver interfaces (CP-SAT first)."
+readme = "README.md"
+requires-python = ">=3.9"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [{ name = "Devin Griffith", email = "dwg176@gmail.com" }]
+keywords = ["pyomo", "constraint-programming", "cp-sat", "or-tools", "gdp", "optimization"]
+classifiers = [
+  "Development Status :: 3 - Alpha",
+  "Intended Audience :: Science/Research",
+  "License :: OSI Approved :: Apache Software License",
+  "Programming Language :: Python :: 3",
+  "Topic :: Scientific/Engineering :: Mathematics",
+]
+dependencies = ["pyomo>=6.7"]
+
+[project.optional-dependencies]
+cpsat = ["ortools>=9.7"]
+dev = ["pytest", "ortools>=9.7"]
+
+[project.urls]
+Homepage = "https://github.com/devin-griff/pyomo-cp"
+Repository = "https://github.com/devin-griff/pyomo-cp"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/pyomo_cp"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]

pyomo_cp-0.1.0/src/pyomo_cp/__init__.py

@@ -0,0 +1,25 @@
+"""pyomo-cp: constraint-programming backends for Pyomo.
+
+Importing this package registers the pyomo-cp plugins:
+
+  * ``TransformationFactory('cp.discretize')`` — discretize bounded continuous
+    variables onto integer grids (an explicit, solver-agnostic step).
+  * ``SolverFactory('cpsat')`` — CP-SAT (OR-Tools) backend.
+
+Scope for now is a *backend framework*: it translates what Pyomo can already
+express (variables, linear constraints, logical constraints, and
+``pyomo.gdp`` disjunctions) to CP solvers. Global-constraint modelling is
+roadmap, not yet supported. See ROADMAP.md.
+"""
+from importlib.metadata import PackageNotFoundError, version
+
+# Import for side effects: these modules register the plugins on import.
+from . import discretize as _discretize  # noqa: F401
+from .backends import cpsat as _cpsat  # noqa: F401
+
+try:
+    __version__ = version("pyomo-cp")
+except PackageNotFoundError:  # not installed (e.g. running from a source tree)
+    __version__ = "0.0.0"
+
+__all__ = ["__version__"]

pyomo_cp-0.1.0/src/pyomo_cp/backends/__init__.py

@@ -0,0 +1,8 @@
+"""CP solver backends for pyomo-cp.
+
+CP-SAT (OR-Tools) is the first backend. A MiniZinc/FlatZinc emitter (reaching
+Chuffed, Gecode, and others) and an IBM CP Optimizer backend are roadmap items;
+see ROADMAP.md. The solver-agnostic intermediate representation those backends
+would share is intentionally deferred until a second backend exists to validate
+its shape.
+"""