text2model 0.1.0__tar.gz → 1.0.0__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (144) hide show
  1. text2model-1.0.0/LICENSE +201 -0
  2. {text2model-0.1.0 → text2model-1.0.0}/PKG-INFO +107 -104
  3. {text2model-0.1.0 → text2model-1.0.0}/README.md +102 -101
  4. {text2model-0.1.0 → text2model-1.0.0}/pyproject.toml +3 -3
  5. {text2model-0.1.0 → text2model-1.0.0}/tests/test_integration.py +53 -0
  6. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/PKG-INFO +107 -104
  7. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/SOURCES.txt +1 -0
  8. {text2model-0.1.0 → text2model-1.0.0}/setup.cfg +0 -0
  9. {text2model-0.1.0 → text2model-1.0.0}/tests/test_main.py +0 -0
  10. {text2model-0.1.0 → text2model-1.0.0}/tests/test_utils.py +0 -0
  11. {text2model-0.1.0 → text2model-1.0.0}/text2model/__init__.py +0 -0
  12. {text2model-0.1.0 → text2model-1.0.0}/text2model/grammar.mzn +0 -0
  13. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_12.ttl +0 -0
  14. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_14.ttl +0 -0
  15. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_2.ttl +0 -0
  16. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_22.ttl +0 -0
  17. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_28.ttl +0 -0
  18. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_30.ttl +0 -0
  19. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_34.ttl +0 -0
  20. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_39.ttl +0 -0
  21. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_54.ttl +0 -0
  22. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_6.ttl +0 -0
  23. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/CSPLib_8.ttl +0 -0
  24. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/LPWP_128.ttl +0 -0
  25. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/LPWP_232.ttl +0 -0
  26. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/LPWP_53.ttl +0 -0
  27. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/LPWP_66.ttl +0 -0
  28. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/LPWP_85.ttl +0 -0
  29. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_1.ttl +0 -0
  30. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_18.ttl +0 -0
  31. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_2.ttl +0 -0
  32. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_28.ttl +0 -0
  33. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_31.ttl +0 -0
  34. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_4.ttl +0 -0
  35. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_5.ttl +0 -0
  36. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_6.ttl +0 -0
  37. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_8.ttl +0 -0
  38. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/combinatorial_problem_1.ttl +0 -0
  39. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/combinatorial_problem_31.ttl +0 -0
  40. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/combinatorial_problem_32.ttl +0 -0
  41. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/combinatorial_problem_7.ttl +0 -0
  42. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_AircraftAssignment.ttl +0 -0
  43. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_AircraftLanding.ttl +0 -0
  44. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_CFLP.ttl +0 -0
  45. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_CapacitatedWarehouseLocation.ttl +0 -0
  46. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_CarSelection.ttl +0 -0
  47. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_TSP.ttl +0 -0
  48. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/complexor_VRPTW.ttl +0 -0
  49. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_1.ttl +0 -0
  50. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_10.ttl +0 -0
  51. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_11.ttl +0 -0
  52. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_12.ttl +0 -0
  53. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_13.ttl +0 -0
  54. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_14.ttl +0 -0
  55. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_15.ttl +0 -0
  56. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_16.ttl +0 -0
  57. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_17.ttl +0 -0
  58. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_18.ttl +0 -0
  59. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_19.ttl +0 -0
  60. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_2.ttl +0 -0
  61. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_20.ttl +0 -0
  62. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_21.ttl +0 -0
  63. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_22.ttl +0 -0
  64. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_23.ttl +0 -0
  65. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_24.ttl +0 -0
  66. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_25.ttl +0 -0
  67. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_27.ttl +0 -0
  68. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_28.ttl +0 -0
  69. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_29.ttl +0 -0
  70. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_3.ttl +0 -0
  71. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_30.ttl +0 -0
  72. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_31.ttl +0 -0
  73. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_32.ttl +0 -0
  74. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_33.ttl +0 -0
  75. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_34.ttl +0 -0
  76. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_35.ttl +0 -0
  77. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_36.ttl +0 -0
  78. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_37.ttl +0 -0
  79. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_38.ttl +0 -0
  80. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_39.ttl +0 -0
  81. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_4.ttl +0 -0
  82. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_40.ttl +0 -0
  83. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_41.ttl +0 -0
  84. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_42.ttl +0 -0
  85. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_43.ttl +0 -0
  86. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_44.ttl +0 -0
  87. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_45.ttl +0 -0
  88. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_46.ttl +0 -0
  89. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_47.ttl +0 -0
  90. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_48.ttl +0 -0
  91. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_49.ttl +0 -0
  92. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_5.ttl +0 -0
  93. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_50.ttl +0 -0
  94. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_51.ttl +0 -0
  95. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_52.ttl +0 -0
  96. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_53.ttl +0 -0
  97. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_54.ttl +0 -0
  98. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_55.ttl +0 -0
  99. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_56.ttl +0 -0
  100. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_57.ttl +0 -0
  101. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_58.ttl +0 -0
  102. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_6.ttl +0 -0
  103. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_60.ttl +0 -0
  104. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_61.ttl +0 -0
  105. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_62.ttl +0 -0
  106. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_63.ttl +0 -0
  107. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_64.ttl +0 -0
  108. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_65.ttl +0 -0
  109. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_66.ttl +0 -0
  110. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_67.ttl +0 -0
  111. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_7.ttl +0 -0
  112. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_8.ttl +0 -0
  113. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/nlp4lp_9.ttl +0 -0
  114. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/non_linear_problem_10.ttl +0 -0
  115. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/non_linear_problem_15.ttl +0 -0
  116. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/non_linear_problem_23.ttl +0 -0
  117. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/non_linear_problem_9.ttl +0 -0
  118. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/puzzles_problem_1.ttl +0 -0
  119. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/puzzles_problem_11.ttl +0 -0
  120. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/puzzles_problem_12.ttl +0 -0
  121. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/puzzles_problem_13.ttl +0 -0
  122. {text2model-0.1.0 → text2model-1.0.0}/text2model/knowledge_graphs/puzzles_problem_31.ttl +0 -0
  123. {text2model-0.1.0 → text2model-1.0.0}/text2model/main.py +0 -0
  124. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/assembler_prompt.txt +0 -0
  125. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/code_stitching_prompt.txt +0 -0
  126. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/code_validation_prompt.txt +0 -0
  127. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/constraint_generation_prompt.txt +0 -0
  128. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/cot_prompt.txt +0 -0
  129. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/all_different_prompt.txt +0 -0
  130. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/count_prompt.txt +0 -0
  131. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/cumulative_prompt.txt +0 -0
  132. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/global_cardinality_prompt.txt +0 -0
  133. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/increasing_prompt.txt +0 -0
  134. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/global_constraint_prompts/lex_less_prompt.txt +0 -0
  135. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/grammar_validation_prompt.txt +0 -0
  136. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/kg_code_generation_prompt.txt +0 -0
  137. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/kg_generation_prompt.txt +0 -0
  138. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/objective_generation_prompt.txt +0 -0
  139. {text2model-0.1.0 → text2model-1.0.0}/text2model/prompts/parameter_and_variable_generation_prompt.txt +0 -0
  140. {text2model-0.1.0 → text2model-1.0.0}/text2model/utils.py +0 -0
  141. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/dependency_links.txt +0 -0
  142. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/entry_points.txt +0 -0
  143. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/requires.txt +0 -0
  144. {text2model-0.1.0 → text2model-1.0.0}/text2model.egg-info/top_level.txt +0 -0
@@ -0,0 +1,201 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright [yyyy] [name of copyright owner]
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
@@ -1,169 +1,157 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: text2model
3
- Version: 0.1.0
3
+ Version: 1.0.0
4
4
  Summary: LLM Modeling Copilots for Text-to-Model Translation
5
- License: MIT
5
+ License: Apache-2.0
6
6
  Keywords: minizinc,constraint-programming,LLM,text-to-model
7
7
  Classifier: Programming Language :: Python :: 3
8
- Classifier: License :: OSI Approved :: MIT License
8
+ Classifier: License :: OSI Approved :: Apache Software License
9
9
  Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
10
10
  Requires-Python: >=3.8
11
11
  Description-Content-Type: text/markdown
12
+ License-File: LICENSE
12
13
  Requires-Dist: openai
13
14
  Requires-Dist: datasets
14
15
  Requires-Dist: tqdm
15
16
  Requires-Dist: langchain-ollama
16
17
  Provides-Extra: test
17
18
  Requires-Dist: pytest; extra == "test"
18
-
19
- # Text2Model: LLM Modeling Copilots for Text-to-Model Translation
19
+ Dynamic: license-file
20
20
 
21
21
  [![Tests](https://github.com/skadio/text2model/actions/workflows/tests.yml/badge.svg)](https://github.com/skadio/text2model/actions/workflows/tests.yml)
22
-
23
- Text-to-model translation is the task of converting natural language descriptions of combinatorial problems into formal constraint models.
24
-
25
- [Text2Model](https://skadio.github.io/text2model/) is a suite of LLM modeling copilots, datasets, fined-tuned models, demos, interactive editor, and online leaderboard for translating natural language text into formal combinatorial constraint models.
26
-
27
- Text2Model uses MiniZinc as the target modeling language which makes our copilots both **paradigm- and solver-agnostic**. Our copilots generate models that can be solved by any MiniZinc compatible solver including Gecode, Chuffed, OR-Tools, CBC, Gurobi, Cplex, HiGH. This covers a wide range of paradigms including CP, CP-SAT, and MIP. As such, Text2Model can address **both combinatorial satisfaction and optimization problems.**
28
-
29
- Please visit [Text2Model](https://skadio.github.io/text2model/) for latest publications and resources.
22
+ [![PyPI version](https://img.shields.io/pypi/v/text2model.svg)](https://pypi.org/project/text2model/)
23
+ [![PyPI license](https://img.shields.io/pypi/l/text2model.svg)](https://pypi.python.org/pypi/text2model/)
24
+ [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat-square)](http://makeapullrequest.com)
25
+ [![Downloads](https://static.pepy.tech/personalized-badge/text2model?period=total&units=international_system&left_color=grey&right_color=orange&left_text=Downloads)](https://pepy.tech/project/text2model)
30
26
 
31
27
  ---
32
28
 
33
- ## Text2Model Copilots
34
-
35
- Text2Model offers different strategies, ranging from simple single-call approaches to sophisticated multi-agent systems. Each makes different trade-offs between speed and accuracy.
36
-
37
- | Strategy | Description |
38
- |----------|----------------------------------------------------------------------------------------------------------------------------------------------------------------|
39
- | `baseline` | Direct code generation from problem description. No special prompting. Good for simple problems or establishing a baseline. |
40
- | `cot` | **Chain-of-Thought** prompting with guiding principles. The LLM reasons through the problem step-by-step before generating code. |
41
- | `knowledge_graph` | First extracts structured information (entities, relationships) from the problem, then generates code from this intermediate representation. |
42
- | `cot_with_code_validation` | Generates code with CoT, then validates and fixes any compilation errors. Good default choice. |
43
- | `cot_with_grammar_validation` | Generates code with CoT, then checks against MiniZinc grammar rules. |
44
- | `cot_with_code_and_grammar_validation` | Combines CoT generation with both grammar checking and code validation. |
45
- | `agents` | Decomposes the task into specialized agents: (1) parameters & variables, (2) constraints, (3) objective, (4) assembler that stitches everything together. |
46
- | `agents_with_code_validation` | Agents approach plus a final validation/fix step. |
47
- | `gala` | Global Agents for different constraint types (all_different, cumulative, etc.) plus an assembler. See the [GALA paper](https://arxiv.org/abs/2509.08970). |
48
-
29
+ <div align="center"><a name="menu"></a>
30
+ <h3>
31
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#text-mode">Text Mode</a>
32
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#text2zinc-mode">Text2Zinc Mode</a> •
33
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#copilots">Copilots</a>
34
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#installation">Installation</a> •
35
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#evaluation">Evaluation</a>
36
+ <a href="https://github.com/skadio/text2model?tab=readme-ov-file#leaderboard">Leaderboard</a>
37
+ </h3>
38
+ </div>
49
39
 
50
40
  ---
51
41
 
52
- ## Quick Start
53
-
54
- ### 1. Install
42
+ # Text2Model: LLM Modeling Copilots for Text-to-Model Translation
55
43
 
56
- ```bash
57
- pip install text2model
58
- ```
44
+ [Text2Model](https://skadio.github.io/text2model/) is a suite of LLM modeling copilots, datasets, fined-tuned models, demos, interactive editor, and online leaderboard for translating natural language text into formal combinatorial constraint models.
59
45
 
60
- Or install from source for development:
46
+ Text2Model uses MiniZinc as the target modeling language which makes our copilots both **paradigm- and solver-agnostic**. Our copilots generate models that can be solved by any MiniZinc compatible solver including Gecode, Chuffed, OR-Tools, CBC, Gurobi, Cplex, HiGH. This covers a wide range of paradigms including CP, CP-SAT, and MIP. As such, Text2Model can address **both combinatorial satisfaction and optimization problems.**
61
47
 
62
- ```bash
63
- git clone https://github.com/skadio/text2model.git
64
- cd text2model
65
- pip install -e .
66
- ```
48
+ Please visit [Text2Model](https://skadio.github.io/text2model/) for latest publications and resources.
67
49
 
68
- ### 2. Set Your API Key
50
+ ## Quick Start
69
51
 
70
- ```bash
71
- export OPENAI_API_KEY="your-api-key-here"
72
- ```
52
+ Text2Model supports translating given problem descriptions, **Text mode**, or specific problems from our dataset, **Text2Zinc mode**.
73
53
 
74
- ### 3. Generate MiniZinc from a Problem Description
54
+ ### Text Mode
75
55
 
76
56
  ```bash
77
- # From a string
57
+ # Translate a given problem description
78
58
  text2model --problem "A country produces fighter jets each year. Some of these jets must be set aside for pilot training instead of combat use. Year 1 production is 10 jets, and Year 2 production is 15 jets. Each training jet can train 5 pilots per year. Training runs for 2 years, starting in Year 1. Determine how many pilots will be trained in total by the end of Year 2."
79
59
 
80
- # From a text file
60
+ # Translate a given problem file
81
61
  text2model --problem my_problem.txt
82
62
 
83
- # Choose a strategy (default: cot)
63
+ # Choose the copilot strategy and the model
64
+ # Note that `knowledge_graph` is not available for text-mode as it requires pre-built TTL files
84
65
  text2model --problem my_problem.txt --strategies agents_with_code_validation --model gpt-4o
85
66
 
86
- # Redirect output to a file
87
- text2model --problem my_problem.txt > model.mzn
67
+ # Redirect the output to a MiniZinc model
68
+ text2model --problem my_problem.txt > my_model.mzn
88
69
  ```
89
70
 
90
- ### 4. Batch Mode on the Dataset
71
+ ### Text2Zinc Mode
91
72
 
92
73
  ```bash
93
- # Try a quick test on specific problems
94
- python main.py --strategies cot --problem-ids 0 1 2 --model gpt-4 --output-dir my_results
74
+ # Translate specific problems from Text2Zinc
75
+ text2model --problem-ids 0 1 2 --strategies cot --model gpt-4 --output-dir my_results
95
76
 
96
- # Or run chain-of-thought on all problems
97
- python main.py --strategies cot --model gpt-4 --output-dir my_results
98
- ```
77
+ # Run multiple strategies on all Text2Zinc problems
78
+ text2model --strategies cot --model gpt-4 --output-dir my_results
99
79
 
100
- ---
80
+ # Run all strategies
81
+ text2model --strategies all --model gpt-4 --output-dir my_results
101
82
 
102
- ## Usage
83
+ # Run on specific source of Text2Zinc problems
84
+ text2model --source nlp4lp --strategies cot --model gpt-4 --output-dir my_results
103
85
 
104
- ### Generate from a Problem Description
86
+ # List all available data sources
87
+ text2model --list-sources
105
88
 
106
- ```bash
107
- # Inline description (prints MiniZinc to stdout)
108
- text2model --problem "A country produces fighter jets each year. Some of these jets must be set aside for pilot training instead of combat use. Year 1 production is 10 jets, and Year 2 production is 15 jets. Each training jet can train 5 pilots per year. Training runs for 2 years, starting in Year 1. Determine how many pilots will be trained in total by the end of Year 2."
89
+ # List all available model options
90
+ # --model accepts gpt-4, gpt-4o, gpt-5.2 (OpenAI, requires OPENAI_API_KEY), or phi4 (served locally through Ollama, no API key needed)
109
91
 
110
- # From a file
111
- text2model --problem problem.txt --strategies cot_with_code_validation
92
+ # Advanced options
93
+ text2model --strategies agents --model gpt-4 \
94
+ --output-dir my_results \
95
+ --temperature 0.7 \
96
+ --max-tokens 8192 \
97
+ --sleep-time 2 \
98
+ --include-unverified
112
99
  ```
113
100
 
114
- > The `knowledge_graph` strategy is not available in this mode (it requires pre-built TTL files).
115
- > The default strategy is `cot`.
101
+ ## Copilots
116
102
 
117
- ### Run Multiple Strategies
103
+ Text2Model offers different copilot strategies, ranging from simple single-call approaches to sophisticated multi-agent systems. Each makes different trade-offs between speed and accuracy.
118
104
 
119
- ```bash
120
- # Compare baseline vs chain-of-thought
121
- python main.py --strategies baseline cot --model gpt-4o --output-dir my_results
105
+ | Strategy | Description |
106
+ |----------|---------------------------------------------------------------------------------------------------------------------------------------------------------------|
107
+ | `baseline` | Direct code generation from problem description. No special prompting. Good for simple problems or establishing a baseline. |
108
+ | `cot` | **Chain-of-Thought** prompting with guiding principles. The LLM reasons through the problem step-by-step before generating code. |
109
+ | `knowledge_graph` | First extracts structured information (entities, relationships) from the problem, then generates code from this intermediate representation. |
110
+ | `cot_with_code_validation` | Generates code with CoT, then validates and fixes any compilation errors. Good default choice. |
111
+ | `cot_with_grammar_validation` | Generates code with CoT, then checks against MiniZinc grammar rules. |
112
+ | `cot_with_code_and_grammar_validation` | Combines CoT generation with both grammar checking and code validation. |
113
+ | `agents` | Decomposes the task into specialized agents: (1) parameters & variables, (2) constraints, (3) objective, (4) assembler that stitches everything together. |
114
+ | `agents_with_code_validation` | Agents approach plus a final validation/fix step. |
115
+ | `gala` | Global Agents for different constraint types (all_different, cumulative, etc.) plus an assembler. See the [GALA paper](https://arxiv.org/abs/2509.08970).|
122
116
 
123
- # Run all 9 strategies
124
- python main.py --strategies all --model gpt-4 --output-dir my_results
125
- ```
117
+ ## Installation
126
118
 
127
- ### Filter by Problem Source
119
+ Text2Model requires **Python 3.8+** and can be installed from PyPI or by building from source.
128
120
 
129
- ```bash
130
- # List available data sources
131
- python main.py --list-sources
121
+ ### Set Your API Key
132
122
 
133
- # Run on specific source
134
- python main.py --strategies cot --model gpt-4 --source nlp4lp --output-dir my_results
123
+ ```bash
124
+ export OPENAI_API_KEY="your-api-key-here"
135
125
  ```
136
126
 
137
- ### Advanced Options
138
-
127
+ ### Install from PyPI
139
128
  ```bash
140
- python main.py --strategies agents --model gpt-4 \
141
- --output-dir my_results \
142
- --temperature 0.7 \
143
- --max-tokens 8192 \
144
- --sleep-time 2 \
145
- --include-unverified
129
+ pip install text2model
146
130
  ```
147
131
 
148
- ---
132
+ ### Install from Source
133
+ ```bash
134
+ git clone https://github.com/skadio/text2model.git
135
+ cd text2model
136
+ pip install -e .
137
+ ```
149
138
 
150
139
  ## Evaluation
151
140
 
152
141
  After generating models, evaluate their correctness via `evaluate.py`. This script compiles and runs each generated MiniZinc model against test instances, checking for both execution success and solution correctness.
153
142
 
154
- ### Prerequisites
143
+ #### Prerequisite
155
144
 
156
145
  Install MiniZinc solver: https://www.minizinc.org/doc-2.5.5/en/installation.html
157
146
 
158
- ### Run Evaluation
147
+ #### Evals
159
148
  ```bash
160
149
  # Evaluate all generated code
150
+ # `--output-dir` is required. Point it at the directory produced by the batch-mode `text2model` run.
161
151
  python evaluate.py --output-dir my_results
162
152
  ```
163
153
 
164
- > **Note:** `--output-dir` is required. Point it at the directory produced by `main.py`.
165
-
166
- ### Metrics
154
+ #### Metrics
167
155
 
168
156
  | Metric | Description |
169
157
  |--------|-------------|
@@ -171,22 +159,28 @@ python evaluate.py --output-dir my_results
171
159
  | **Solution Accuracy** | % of models that produce correct solutions |
172
160
  | **Average Score** | Average of execution and solution accuracy |
173
161
 
174
- Results are broken down by problem type (satisfaction vs optimization).
162
+ Results are broken down by problem type as satisfaction vs. optimization.
175
163
 
176
- ---
164
+ ## Leaderboard
165
+
166
+ Text2Model hosts an online leaderboard tracking execution accuracy, solution accuracy, and average score across models and copilot strategies on the Text2Zinc benchmark:
167
+
168
+ **[Text2Model Leaderboard](https://huggingface.co/spaces/skadio/text2model-leaderboard)** (Hugging Face Spaces)
177
169
 
178
170
  ## Testing
179
171
 
180
172
  Install test dependencies with `pip install -e ".[test]"`.
181
173
 
182
- **Offline tests** (`tests/test_main.py`, `tests/test_utils.py`) don't need an API key, network, or MiniZinc — they're pure logic tests with mocked API calls. This is what CI runs:
174
+ **Default tests** (`tests/test_main.py`, `tests/test_utils.py`) do not need an API key, network, or MiniZinc.
175
+ They are pure logic tests with mocked API calls and is run by the CI:
183
176
 
184
177
  ```bash
185
178
  pytest -m "not integration"
186
179
  ```
187
180
 
188
- **Integration tests** (`tests/test_integration.py`) hit real external dependencies and are opt-in only — never run in CI:
189
- - MiniZinc tests run the real `minizinc` binary and are skipped unless it's on `PATH`.
181
+ **Integration tests** (`tests/test_integration.py`) hit real external dependencies and are opt-in only.
182
+ This is not to be used in CI:
183
+ - MiniZinc tests run the real `minizinc` binary and are skipped unless it is on `PATH`.
190
184
  - The OpenAI test makes exactly one real, cheap, token-capped call (`gpt-4o-mini`, `max_tokens=20`) and is skipped unless `OPENAI_API_KEY` is set. It's intentionally not exhaustive to avoid API costs.
191
185
 
192
186
  To run everything locally (with `OPENAI_API_KEY` set and MiniZinc installed):
@@ -195,10 +189,7 @@ To run everything locally (with `OPENAI_API_KEY` set and MiniZinc installed):
195
189
  pytest -m ""
196
190
  ```
197
191
 
198
- ---
199
-
200
192
  ## Repository Structure
201
-
202
193
  ```
203
194
  text2model/
204
195
  ├── text2model/ # Installable Python package
@@ -211,11 +202,23 @@ text2model/
211
202
  │ ├── grammar.mzn # MiniZinc grammar for validation
212
203
  │ ├── main.py # Copilot strategies and CLI entry point
213
204
  │ └── utils.py # Shared utilities (API calls, validation)
205
+ ├── tests/ # Unit and integration tests (pytest)
214
206
  ├── output/ # Generated models (created automatically)
215
207
  │ ├── [model]/[strategy]/ # e.g., gpt-4/cot/problem_1.mzn
216
208
  │ └── evaluation_results/ # Accuracy metrics and leaderboard
217
209
  ├── evaluate.py # Evaluates generated MiniZinc models
218
210
  ├── generate_knowledge_graph.py # Generates KGs for knowledge_graph strategy
219
- ├── main.py # Backward-compatible entry point
220
- └── pyproject.toml # Package metadata and install config
211
+ ├── pyproject.toml # Package metadata and install config
212
+ ├── CHANGELOG.txt # Release history
213
+ └── LICENSE # Apache License 2.0
221
214
  ```
215
+
216
+ ## Support
217
+
218
+ Please submit bug reports and feature requests as [Issues](https://github.com/skadio/text2model/issues).
219
+
220
+ ## License
221
+
222
+ Text2Model is licensed under the [Apache License 2.0](LICENSE).
223
+
224
+ <br>