text2model 0.1.0__py3-none-any.whl

text2model/__init__.py

@@ -0,0 +1 @@
+"""text2model: LLM Modeling Copilots for Text-to-Model Translation."""

text2model/grammar.mzn

@@ -0,0 +1,277 @@
+% A MiniZinc model
+<model> ::= [ <item> ";" ... ]
+
+% Items
+<item>  ::= <include-item>
+          | <var-decl-item>
+          | <enum-item>
+          | <type-inst-syn-item>
+          | <assign-item>
+          | <constraint-item> 
+          | <solve-item>
+          | <output-item>
+          | <predicate-item>
+          | <test-item>
+          | <function-item>
+          | <annotation-item>
+
+<ti-expr-and-id> ::= <ti-expr> ":" <ident>
+
+% Include items
+<include-item> ::= "include" <string-literal>
+
+% Variable declaration items
+<var-decl-item> ::= <ti-expr-and-id> <annotations> [ "=" <expr> ]
+                  | "any" ":" <ident> <annotations> [ "=" <expr> ]
+
+% Enum items
+<enum-item>  ::= "enum" <ident> <annotations> [ "=" <enum-cases-list> ]
+
+<enum-cases-list> ::= <enum-cases>
+                    | <enum-cases-list> "++" <enum-cases>
+
+<enum-cases> ::= "{" <ident> "," ... "}"
+               | "_" "(" <expr> ")"
+               | <ident> "(" <ident> ")"
+               | "anon_enum" "(" <expr> ")"
+
+% Type-inst synonym items
+<type-inst-syn-item> ::= "type" <ident> <annotations> "=" <ti-expr>
+
+% Assign items
+<assign-item> ::= <ident> "=" <expr>
+
+% Constraint items
+<constraint-item> ::= "constraint" [ <string-annotation> ] <expr>
+
+% Solve item
+<solve-item> ::= "solve" <annotations> "satisfy"
+               | "solve" <annotations> "minimize" <expr>
+               | "solve" <annotations> "maximize" <expr>
+
+% Output items
+<output-item> ::= "output" [ <string-annotation> ] <expr>
+
+% Annotation items
+<annotation-item> ::= "annotation" <ident> <params> [ "=" <expr> ]
+
+% Predicate, test and function items
+<predicate-item> ::= "predicate" <operation-item-tail>
+
+<test-item> ::= "test" <operation-item-tail>
+
+<function-item> ::= "function" <ti-expr> ":" <operation-item-tail>
+
+<operation-item-tail> ::= <ident> <params> <annotations> [ "=" <expr> ]
+
+<params> ::= [ ( <ti-expr-and-id> "," ... ) ]
+
+% Type-inst expressions
+<ti-expr> ::= <base-ti-expr>
+            | <array-ti-expr>
+
+<base-ti-expr> ::= <var-par> <opt-ti> <set-ti> <base-ti-expr-tail> ["++" <base-ti-expr>]
+                 | "any" <ti-variable-expr-tail>
+
+<var-par> ::= "var" | "par" | ε
+
+<opt-ti> ::= "opt" | ε
+
+<set-ti> ::= "set" "of" | ε
+
+<base-type> ::= "bool"
+              | "int"
+              | "float"
+              | "string"
+
+<base-ti-expr-tail> ::= <ident>
+                      | <base-type>
+                      | <ti-variable-expr-tail>
+                      | <tuple-ti-expr-tail>
+                      | <record-ti-expr-tail>
+                      | "ann"
+                      | <expr>
+
+% Type-inst variables
+<ti-variable-expr-tail> ::= $[A-Za-z$][A-Za-z0-9_]*
+
+% Array type-inst expressions
+<array-ti-expr> ::= "array" [ <ti-expr> "," ... ] "of" <base-ti-expr>
+                  | "list" "of" <base-ti-expr>
+
+% Tuple type-inst expressions
+<tuple-ti-expr-tail> ::= "tuple" ( <ti-expr> "," ... )
+
+% Record type-inst expressions
+<record-ti-expr-tail> ::= "record" ( <ti-expr-and-id> "," ... )
+
+% Expressions
+<expr> ::= <expr-atom> <expr-binop-tail>
+
+<expr-atom> ::= <expr-atom-head> <expr-atom-tail> <annotations>
+
+<expr-binop-tail> ::= [ <bin-op> <expr> ]
+
+<expr-atom-head> ::= <builtin-un-op> <expr-atom>
+                   | "(" <expr> ")"
+                   | <ident-or-quoted-op>
+                   | "_"
+                   | <bool-literal>
+                   | <int-literal>
+                   | <float-literal>
+                   | <string-literal>
+                   | <set-literal>
+                   | <set-comp>
+                   | <array-literal>
+                   | <array-literal-2d>
+                   | <indexed-array-literal>
+                   | <indexed-array-literal-2d>
+                   | <tuple-literal>
+                   | <record-literal>
+                   | <array-comp>
+                   | <indexed-array-comp>
+                   | <ann-literal>
+                   | <if-then-else-expr>
+                   | <let-expr>
+                   | <call-expr>
+                   | <gen-call-expr>
+
+<expr-atom-tail> ::= ε
+                   | <array-access-tail> <expr-atom-tail>
+
+% Numeric expressions
+<num-expr> ::= <num-expr-atom> <num-expr-binop-tail>
+
+<num-expr-atom> ::= <num-expr-atom-head> <expr-atom-tail> <annotations>
+
+<num-expr-binop-tail> ::= [ <num-bin-op> <num-expr> ]
+
+<num-expr-atom-head> ::= <builtin-num-un-op> <num-expr-atom>
+                       | "(" <num-expr> ")"
+                       | <ident-or-quoted-op>
+                       | <int-literal>
+                       | <float-literal>
+                       | <if-then-else-expr>
+                       | <let-expr>
+                       | <call-expr>
+                       | <gen-call-expr>
+
+% Built-in operators
+<builtin-op> ::= <builtin-bin-op> | <builtin-un-op>
+
+<bin-op> ::= <builtin-bin-op> | ‘<ident>‘
+
+<builtin-bin-op> ::= "<->" | "->" | "<-" | "\/" | "xor" | "/\"
+                   | "<" | ">" | "<=" | ">=" | "==" | "=" | "!="
+                   | "~=" | "~!="
+                   | "in" | "subset" | "superset" | "union" | "diff" | "symdiff"
+                   | ".." | "intersect" | "++" | "default" | <builtin-num-bin-op>
+
+<builtin-un-op> ::= "not" | <builtin-num-un-op>
+
+% Built-in numeric operators
+<num-bin-op> ::= <builtin-num-bin-op> | ‘<ident>‘
+
+<builtin-num-bin-op> ::= "+" | "-" | "*" | "/" | "div" | "mod" | "^"
+                       | "~+" | "~-" | "~*" | "~/" | "~div"
+
+<builtin-num-un-op> ::= "+" | "-"
+
+% Boolean literals
+<bool-literal> ::= "false" | "true"
+
+% Integer literals
+<int-literal> ::= [0-9]+
+                | 0x[0-9A-Fa-f]+
+                | 0o[0-7]+
+
+% Float literals
+<float-literal> ::= [0-9]+"."[0-9]+
+                  | [0-9]+"."[0-9]+[Ee][-+]?[0-9]+
+                  | [0-9]+[Ee][-+]?[0-9]+
+                  | 0[xX]([0-9a-fA-F]*"."[0-9a-fA-F]+|[0-9a-fA-F]+".")([pP][+-]?[0-9]+)
+                  | (0[xX][0-9a-fA-F]+[pP][+-]?[0-9]+)
+
+% String literals
+<string-contents> ::= ([^"\n\] |  \[0-7][0-7?][0-7]? | \x[0-9a-fA-F][0-9a-fA-F]? | \n | \t | \" | \\)*
+
+<string-literal> ::= """ <string-contents> """
+                   | """ <string-contents> "\(" <string-interpolate-tail>
+
+<string-interpolate-tail> ::= <expr> ")"<string-contents>"""
+                            | <expr> ")"<string-contents>"\(" <string-interpolate-tail>
+
+% Set literals
+<set-literal> ::= "{" [ <expr> "," ... ] "}"
+
+% Set comprehensions
+<set-comp> ::= "{" <expr> "|" <comp-tail> "}"
+
+<comp-tail> ::= <generator> [ "where" <expr> ] "," ...
+
+<generator> ::= ( <ident> | "_" ) "," ... "in" <expr>
+
+% Array literals
+<array-literal> ::= "[" [ <expr> "," ... ] "]"
+
+% 2D Array literals
+<array-literal-2d> ::= "[|" [ [ <expr> "," ... ] "|" ... ] "|]"
+
+% Indexed 2D Array literals
+<indexed-array-literal-2d> ::= "[|" [ <expr> ":" ... ] [ [ <expr> ":" ] <expr> "," ... ] "|]"
+
+% Indexed array literals
+<indexed-array-literal> ::= "[" [ ( <index-tuple> ":" <expr> ) "," ... ] "]"
+                          | "[" [ <index-tuple> ":" <expr> "," <expr> "," ... ] "]"
+
+<index-tuple> ::= <expr>
+                | "(" [ <expr> "," ... ] ")"
+
+% Tuple literals
+<tuple-literal> ::= "(" <expr> "," [ <expr> "," ... ] ")"
+
+% Record literals
+<record-literal> ::= "(" <ident> ":" <expr> "," [ <ident> ":" <expr> "," ... ] ")"
+
+% Array comprehensions
+<array-comp> ::= "[" <expr> "|" <comp-tail> "]"
+
+% Indexed array comprehensions
+<indexed-array-comp> ::= "[" <index-tuple> ":" <expr> "|" <comp-tail> "]"
+
+% Array access
+<array-access-tail> ::= "[" <expr> "," ... "]"
+
+% Annotation literals
+<ann-literal> ::= <ident> [ "(" <expr> "," ... ")" ]
+
+% If-then-else expressions
+<if-then-else-expr> ::= "if" <expr> "then" <expr> [ "elseif" <expr> "then" <expr> ]* [ "else" <expr> ] "endif"
+
+% Call expressions
+<call-expr> ::= <ident-or-quoted-op> [ "(" <expr> "," ... ")" ]
+
+% Let expressions
+<let-expr> ::= "let" "{" <let-item> ";" ... "}" "in" <expr>
+
+<let-item> ::= <var-decl-item>
+             | <constraint-item>
+
+% Generator call expressions
+<gen-call-expr> ::= <ident-or-quoted-op> "(" <comp-tail> ")" "(" <expr> ")"
+
+% Miscellaneous
+
+% Identifiers
+<ident> ::= _?[A-Za-z][A-Za-z0-9_]* | ’[^’\xa\xd\x0]+’
+
+% Identifiers and quoted operators
+<ident-or-quoted-op> ::= <ident>
+                       | ’<builtin-op>’
+
+% Annotations
+<annotations> ::= [ "::" <annotation> ]*
+
+<annotation> ::= <expr-atom-head> <expr-atom-tail>
+
+<string-annotation> ::= "::" <string-literal>

text2model/knowledge_graphs/CSPLib_12.ttl

@@ -0,0 +1,41 @@
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix owl: <http://www.w3.org/2002/07/owl#> .
+@prefix : <http://example.org/> .
+
+:rows a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of rows in the grid" .
+
+:row_rule_len a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Length of row_rules for each row (number of constraints)" .
+
+:row_rules a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range :Array2D ;
+    rdfs:comment "Constraints for each row in the grid indicating the sequence of shaded blocks" .
+
+:cols a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of columns in the grid" .
+
+:col_rule_len a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Length of col_rules for each column (number of constraints)" .
+
+:col_rules a rdf:Property ;
+    rdfs:domain :Nonogram ;
+    rdfs:range :Array2D ;
+    rdfs:comment "Constraints for each column in the grid indicating the sequence of shaded blocks" .
+
+:Array2D a rdfs:Class ;
+    rdfs:comment "2D array of integers" .
+
+:Nonogram a rdfs:Class ;
+    rdfs:comment "Nonogram puzzle" .

text2model/knowledge_graphs/CSPLib_14.ttl

@@ -0,0 +1,51 @@
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix sb: <http://www.example.org/solitairebattleships#> .
+
+sb:height a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:integer .
+
+sb:width a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:integer .
+
+sb:maxship a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:integer .
+
+sb:hint a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:array .
+
+sb:rowsum a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:array .
+
+sb:colsum a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:array .
+
+sb:ship a rdf:Property ;
+    rdfs:domain sb:SolitaireBattleships ;
+    rdfs:range xsd:array .
+
+sb:SolitaireBattleships a rdfs:Class ;
+    rdfs:comment "A class representing the Solitaire Battleships problem" .
+
+sb:Board a rdfs:Class ;
+    rdfs:subClassOf sb:SolitaireBattleships ;
+    rdfs:comment "A class representing the board in the Solitaire Battleships problem" .
+
+sb:Ship a rdfs:Class ;
+    rdfs:subClassOf sb:SolitaireBattleships ;
+    rdfs:comment "A class representing the ships in the Solitaire Battleships problem" .
+
+sb:Constraint a rdfs:Class ;
+    rdfs:subClassOf sb:SolitaireBattleships ;
+    rdfs:comment "A class representing the constraints in the Solitaire Battleships problem" .
+
+sb:Objective a rdfs:Class ;
+    rdfs:subClassOf sb:SolitaireBattleships ;
+    rdfs:comment "A class representing the objective in the Solitaire Battleships problem" .

text2model/knowledge_graphs/CSPLib_2.ttl

@@ -0,0 +1,59 @@
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix opt: <http://www.example.org/optimization#> .
+
+opt:slotsPerTemplate a rdf:Property ;
+    rdfs:label "Number of slots per template" ;
+    rdfs:domain opt:PrintingProblem ;
+    rdfs:range xsd:integer .
+
+opt:numberOfTemplates a rdf:Property ;
+    rdfs:label "Number of templates to produce" ;
+    rdfs:domain opt:PrintingProblem ;
+    rdfs:range xsd:integer .
+
+opt:numberOfVariations a rdf:Property ;
+    rdfs:label "Number of variations of carton designs" ;
+    rdfs:domain opt:PrintingProblem ;
+    rdfs:range xsd:integer .
+
+opt:demandArray a rdf:Property ;
+    rdfs:label "Array indicating how many of each variation must be printed" ;
+    rdfs:domain opt:PrintingProblem ;
+    rdfs:range xsd:integer .
+
+opt:PrintingProblem a rdfs:Class ;
+    rdfs:label "Color Printing Optimization Problem" ;
+    rdfs:subClassOf opt:OptimizationProblem .
+
+opt:OptimizationProblem a rdfs:Class ;
+    rdfs:label "Optimization Problem" .
+
+opt:hasObjective a rdf:Property ;
+    rdfs:label "has objective" ;
+    rdfs:domain opt:OptimizationProblem ;
+    rdfs:range opt:Objective .
+
+opt:Objective a rdfs:Class ;
+    rdfs:label "Objective" .
+
+opt:minimizeSurplus a opt:Objective ;
+    rdfs:label "Minimize surplus" ;
+    rdfs:comment "The configurations of the slots for the templates that leads to the minimum amount of surplus when all the demands are met" .
+
+opt:hasConstraint a rdf:Property ;
+    rdfs:label "has constraint" ;
+    rdfs:domain opt:OptimizationProblem ;
+    rdfs:range opt:Constraint .
+
+opt:Constraint a rdfs:Class ;
+    rdfs:label "Constraint" .
+
+opt:meetDemand a opt:Constraint ;
+    rdfs:label "Meet demand" ;
+    rdfs:comment "A minimum demand of each design variation that must be manufactured" .
+
+opt:lexicographicOrder a opt:Constraint ;
+    rdfs:label "Lexicographic order" ;
+    rdfs:comment "The templates are organized in lexicographic order" .

text2model/knowledge_graphs/CSPLib_22.ttl

@@ -0,0 +1,62 @@
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix opt: <http://www.example.org/optimization#> .
+
+opt:BusDriverScheduling
+    rdf:type opt:OptimizationProblem ;
+    opt:hasParameter opt:num_work, opt:num_shifts, opt:min_num_shifts, opt:shifts ;
+    opt:hasVariable opt:shift_selection ;
+    opt:hasConstraint opt:work_coverage, opt:min_shift_requirement ;
+    opt:hasObjective opt:minimize_shifts .
+
+opt:num_work
+    rdf:type opt:Parameter ;
+    rdfs:label "num_work" ;
+    rdfs:comment "Number of pieces of work to cover" ;
+    rdfs:range xsd:integer .
+
+opt:num_shifts
+    rdf:type opt:Parameter ;
+    rdfs:label "num_shifts" ;
+    rdfs:comment "Number of possible shifts available" ;
+    rdfs:range xsd:integer .
+
+opt:min_num_shifts
+    rdf:type opt:Parameter ;
+    rdfs:label "min_num_shifts" ;
+    rdfs:comment "Minimum number of shifts required for a partition" ;
+    rdfs:range xsd:integer .
+
+opt:shifts
+    rdf:type opt:Parameter ;
+    rdfs:label "shifts" ;
+    rdfs:comment "Details of shifts each shift covers" ;
+    rdfs:range rdf:Seq .
+
+opt:shift_selection
+    rdf:type opt:Variable ;
+    rdfs:label "shift_selection" ;
+    rdfs:comment "Selection of shifts to cover the work" ;
+    rdfs:range rdf:Seq .
+
+opt:work_coverage
+    rdf:type opt:Constraint ;
+    rdfs:label "work_coverage" ;
+    rdfs:comment "Each piece of work must be covered exactly once" .
+
+opt:min_shift_requirement
+    rdf:type opt:Constraint ;
+    rdfs:label "min_shift_requirement" ;
+    rdfs:comment "The number of shifts used must be at least the minimum number of shifts required" .
+
+opt:minimize_shifts
+    rdf:type opt:Objective ;
+    rdfs:label "minimize_shifts" ;
+    rdfs:comment "Minimize the number of shifts used" ;
+    opt:optimizationType opt:Minimization . 
+
+opt:Minimization
+    rdf:type opt:OptimizationType ;
+    rdfs:label "Minimization" ;
+    rdfs:comment "The goal is to minimize the objective function" .

text2model/knowledge_graphs/CSPLib_28.ttl

@@ -0,0 +1,28 @@
+Sorry, as a text-based AI model, I'm unable to generate visual content such as graphs or diagrams. However, I can provide you with a textual representation of the knowledge graph.
+
+1. Parameters:
+   - v: Number of distinct objects (Type: Scalar)
+   - k: Number of distinct objects in each block (Type: Scalar)
+   - lambda: Scalar product between any pair of distinct rows (Type: Scalar)
+
+2. Variables:
+   - Objects: The distinct objects that need to be arranged (Type: Set)
+   - Blocks: The groups in which objects are arranged (Type: Set)
+
+3. Constraints:
+   - Each block must contain exactly k distinct objects.
+   - Each object must appear in exactly lambda blocks.
+   - Each pair of objects must appear together in exactly lambda blocks.
+
+4. Objective:
+   - The goal is to arrange the objects into blocks according to the constraints. This is a satisfaction problem, so there is no explicit objective function to minimize or maximize.
+
+5. Turtle (TTL) Representation:
+   - :v rdf:type owl:DatatypeProperty .
+   - :k rdf:type owl:DatatypeProperty .
+   - :lambda rdf:type owl:DatatypeProperty .
+   - :Objects rdf:type owl:Class .
+   - :Blocks rdf:type owl:Class .
+   - :hasObject rdf:type owl:ObjectProperty ; rdfs:domain :Blocks ; rdfs:range :Objects .
+   - :appearsIn rdf:type owl:ObjectProperty ; rdfs:domain :Objects ; rdfs:range :Blocks .
+   - :appearsTogether rdf:type owl:ObjectProperty ; rdfs:domain :Objects ; rdfs:range :Objects .

text2model/knowledge_graphs/CSPLib_30.ttl

@@ -0,0 +1,72 @@
+@prefix bacp: <http://www.semanticweb.org/ontologies/bacp#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+bacp:Problem a rdfs:Class ;
+    rdfs:label "Balanced Academic Curriculum Problem" .
+
+bacp:hasParameter a rdf:Property ;
+    rdfs:domain bacp:Problem ;
+    rdfs:range bacp:Parameter .
+
+bacp:Parameter a rdfs:Class ;
+    rdfs:label "Parameter" ;
+    rdfs:subClassOf [ a rdfs:Class ;
+        rdfs:label "Scalar" ;
+        rdfs:subClassOf [ a rdfs:Class ;
+            rdfs:label "Integer" ] ] .
+
+bacp:n_courses a bacp:Parameter ;
+    rdfs:label "Number of courses in the academic curriculum" ;
+    rdfs:comment "Example: n_courses=6" .
+
+bacp:n_periods a bacp:Parameter ;
+    rdfs:label "Number of academic periods available for scheduling" ;
+    rdfs:comment "Example: n_periods=3" .
+
+bacp:load_per_period_lb a bacp:Parameter ;
+    rdfs:label "Lower bound for academic load per period" ;
+    rdfs:comment "Example: load_per_period_lb=10" .
+
+bacp:load_per_period_ub a bacp:Parameter ;
+    rdfs:label "Upper bound for academic load per period" ;
+    rdfs:comment "Example: load_per_period_ub=30" .
+
+bacp:courses_per_period_lb a bacp:Parameter ;
+    rdfs:label "Lower bound for number of courses per period" ;
+    rdfs:comment "Example: courses_per_period_lb=2" .
+
+bacp:courses_per_period_ub a bacp:Parameter ;
+    rdfs:label "Upper bound for number of courses per period" ;
+    rdfs:comment "Example: courses_per_period_ub=4" .
+
+bacp:course_load a bacp:Parameter ;
+    rdfs:label "Array representing the academic load of each course" ;
+    rdfs:comment "Example: course_load=[5, 10, 15, 10, 5, 10]" ;
+    rdfs:subClassOf [ a rdfs:Class ;
+        rdfs:label "Array" ;
+        rdfs:subClassOf [ a rdfs:Class ;
+            rdfs:label "Integer" ] ] .
+
+bacp:hasVariable a rdf:Property ;
+    rdfs:domain bacp:Problem ;
+    rdfs:range bacp:Variable .
+
+bacp:Variable a rdfs:Class ;
+    rdfs:label "Variable" .
+
+bacp:hasConstraint a rdf:Property ;
+    rdfs:domain bacp:Problem ;
+    rdfs:range bacp:Constraint .
+
+bacp:Constraint a rdfs:Class ;
+    rdfs:label "Constraint" .
+
+bacp:hasObjective a rdf:Property ;
+    rdfs:domain bacp:Problem ;
+    rdfs:range bacp:Objective .
+
+bacp:Objective a rdfs:Class ;
+    rdfs:label "Objective" ;
+    rdfs:comment "Minimizes the maximum courseload across all periods" .

text2model/knowledge_graphs/CSPLib_34.ttl

@@ -0,0 +1,52 @@
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix owl: <http://www.w3.org/2002/07/owl#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix wlp: <http://www.example.org/warehouse_location_problem#> .
+
+wlp:n_suppliers a owl:DatatypeProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of warehouse candidates" .
+
+wlp:n_stores a owl:DatatypeProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of stores" .
+
+wlp:building_cost a owl:DatatypeProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Cost of opening a warehouse" .
+
+wlp:capacity a owl:DatatypeProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Array containing the capacity of each warehouse" .
+
+wlp:cost_matrix a owl:DatatypeProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Cost matrix where each element represents the cost of a store being supplied by a warehouse" .
+
+wlp:WarehouseLocationProblem a owl:Class ;
+    rdfs:subClassOf owl:Thing ;
+    rdfs:comment "Warehouse Location Problem (WLP) is an optimization problem where a company aims to open warehouses at candidate locations to supply its stores. Each warehouse has a maintenance cost and specific capacity. Each store must be supplied by exactly one warehouse, with supply costs varying per warehouse. The goal is to minimize the sum of maintenance and supply costs by determining which warehouses to open and assigning them to supply stores." .
+
+wlp:hasObjective a owl:ObjectProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range wlp:Objective ;
+    rdfs:comment "The objective of the Warehouse Location Problem" .
+
+wlp:Objective a owl:Class ;
+    rdfs:subClassOf owl:Thing ;
+    rdfs:comment "The objective of the Warehouse Location Problem is to minimize the sum of maintenance and supply costs by determining which warehouses to open and assigning them to supply stores." .
+
+wlp:hasConstraint a owl:ObjectProperty ;
+    rdfs:domain wlp:WarehouseLocationProblem ;
+    rdfs:range wlp:Constraint ;
+    rdfs:comment "The constraints of the Warehouse Location Problem" .
+
+wlp:Constraint a owl:Class ;
+    rdfs:subClassOf owl:Thing ;
+    rdfs:comment "The constraints of the Warehouse Location Problem are that each store must be supplied by exactly one warehouse and the supply costs vary per warehouse." .