text2model 0.1.0__py3-none-any.whl

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_2.ttl

@@ -0,0 +1,43 @@
+@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:courses rdf:type rdfs:Class ;
+    rdfs:label "courses" ;
+    rdfs:comment "Number of courses" ;
+    rdfs:range xsd:integer .
+
+opt:periods rdf:type rdfs:Class ;
+    rdfs:label "periods" ;
+    rdfs:comment "Number of periods" ;
+    rdfs:range xsd:integer .
+
+opt:rooms rdf:type rdfs:Class ;
+    rdfs:label "rooms" ;
+    rdfs:comment "Number of rooms available" ;
+    rdfs:range xsd:integer .
+
+opt:available rdf:type rdfs:Class ;
+    rdfs:label "available" ;
+    rdfs:comment "Binary matrix where A[i,j]=1 indicates lectures of course i can be scheduled at period j" ;
+    rdfs:range xsd:array .
+
+opt:conflict rdf:type rdfs:Class ;
+    rdfs:label "conflict" ;
+    rdfs:comment "Conflict matrix where M[i,j]=1 if courses i and j have common students" ;
+    rdfs:range xsd:array .
+
+opt:requirement rdf:type rdfs:Class ;
+    rdfs:label "requirement" ;
+    rdfs:comment "Array containing the number of lectures required per course" ;
+    rdfs:range xsd:array .
+
+opt:TimetableProblem rdf:type rdfs:Class ;
+    rdfs:label "Timetable Problem" ;
+    rdfs:comment "The Timetable problem involves scheduling lectures for a given number of courses, each comprising a given number of lectures, across a given number of periods. Some courses have conflicts between them and can't be scheduled at the same time. Courses are only available to be scheduled for certain times, and there's a limit on the number of lectures that can be scheduled per period. Each course has a required number of lectures. The objective is to allocate lectures to periods satisfying all constraints." ;
+    rdfs:subClassOf opt:OptimizationProblem .
+
+opt:OptimizationProblem rdf:type rdfs:Class ;
+    rdfs:label "Optimization Problem" ;
+    rdfs:comment "A problem that requires finding the best solution from all feasible solutions." .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_28.ttl

@@ -0,0 +1,42 @@
+@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:num_parts a rdf:Property ;
+    rdfs:label "num_parts" ;
+    rdfs:comment "Number of different parts to buy" ;
+    rdfs:range xsd:integer .
+
+opt:num_stores a rdf:Property ;
+    rdfs:label "num_stores" ;
+    rdfs:comment "Number of stores to choose from" ;
+    rdfs:range xsd:integer .
+
+opt:product_stores a rdf:Property ;
+    rdfs:label "product_stores" ;
+    rdfs:comment "Prices of each part in each store" ;
+    rdfs:range xsd:float .
+
+opt:store_delivery_costs a rdf:Property ;
+    rdfs:label "store_delivery_costs" ;
+    rdfs:comment "Delivery cost of each store" ;
+    rdfs:range xsd:float .
+
+opt:OptimizationProblem a rdfs:Class ;
+    rdfs:label "Optimization Problem" ;
+    rdfs:comment "The problem involves selecting the optimal store for each part to minimize the total cost of buying all parts including delivery costs." .
+
+opt:OptimizationProblem rdfs:subClassOf opt:num_parts, opt:num_stores, opt:product_stores, opt:store_delivery_costs .
+
+opt:objective a rdf:Property ;
+    rdfs:label "objective" ;
+    rdfs:comment "The objective is to find the optimal assignment of parts to stores to minimize the total cost." ;
+    rdfs:domain opt:OptimizationProblem ;
+    rdfs:range xsd:string .
+
+opt:constraint a rdf:Property ;
+    rdfs:label "constraint" ;
+    rdfs:comment "If multiple products are purchased from a store then the delivery cost remains the same." ;
+    rdfs:domain opt:OptimizationProblem ;
+    rdfs:range xsd:string .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_31.ttl

@@ -0,0 +1,44 @@
+@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:JobShopProblem a rdfs:Class ;
+    rdfs:label "Job Shop Problem" ;
+    rdfs:comment "An optimization problem that involves scheduling a set of jobs on a set of machines with the objective to minimize the earliest end time." .
+
+opt:num_jobs a rdf:Property ;
+    rdfs:label "Number of jobs" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of jobs to be scheduled." .
+
+opt:num_machines a rdf:Property ;
+    rdfs:label "Number of machines" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of machines available for job scheduling." .
+
+opt:job_times a rdf:Property ;
+    rdfs:label "Job times" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range rdfs:Literal ;
+    rdfs:comment "Matrix representing the time each job takes on each machine." .
+
+opt:job_order a rdf:Property ;
+    rdfs:label "Job order" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range rdfs:Literal ;
+    rdfs:comment "Matrix representing the order of jobs on each machine." .
+
+opt:objective a rdf:Property ;
+    rdfs:label "Objective" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range rdfs:Literal ;
+    rdfs:comment "Minimize the earliest end time." .
+
+opt:constraint a rdf:Property ;
+    rdfs:label "Constraint" ;
+    rdfs:domain opt:JobShopProblem ;
+    rdfs:range rdfs:Literal ;
+    rdfs:comment "Jobs do not overlap on a machine and are processed in the correct order across machines." .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_4.ttl

@@ -0,0 +1,48 @@
+@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.semanticweb.org/ontologies/optimization#> .
+
+opt:GridSize a rdf:Property ;
+    rdfs:label "n" ;
+    rdfs:domain opt:Problem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Size of the grid - number of rows and columns" .
+
+opt:Huts a rdf:Property ;
+    rdfs:label "huts" ;
+    rdfs:domain opt:Problem ;
+    rdfs:range opt:Grid ;
+    rdfs:comment "Grid representing the location of villagers in need of relief supplies" .
+
+opt:Grid a rdfs:Class ;
+    rdfs:label "Grid" ;
+    rdfs:comment "A 2D array representing the grid of the problem" .
+
+opt:Problem a rdfs:Class ;
+    rdfs:label "Problem" ;
+    rdfs:comment "The optimization problem of coordinating relief efforts" .
+
+opt:AirDropLocations a rdf:Property ;
+    rdfs:label "airDropLocations" ;
+    rdfs:domain opt:Problem ;
+    rdfs:range opt:Grid ;
+    rdfs:comment "The chosen airdrop locations on the grid" .
+
+opt:MinimizeTotalDistance a rdf:Property ;
+    rdfs:label "minimizeTotalDistance" ;
+    rdfs:domain opt:Problem ;
+    rdfs:range xsd:boolean ;
+    rdfs:comment "Objective to minimize the sum of squared distances of huts to their closest relief package destination" .
+
+opt:Constraint a rdfs:Class ;
+    rdfs:label "Constraint" ;
+    rdfs:comment "Constraints of the problem" .
+
+opt:TwoAirDropLocations a opt:Constraint ;
+    rdfs:label "twoAirDropLocations" ;
+    rdfs:comment "Constraint that exactly two airdrop locations can be chosen" .
+
+opt:ClosestAirDropLocation a opt:Constraint ;
+    rdfs:label "closestAirDropLocation" ;
+    rdfs:comment "Constraint that each villager will pick up supplies from the nearest drop location" .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_5.ttl

@@ -0,0 +1,40 @@
+@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.semanticweb.org/ontologies/optimization#> .
+
+:AssignmentProblem a opt:OptimizationProblem ;
+    rdfs:label "Assignment Problem" ;
+    opt:hasObjective :Objective ;
+    opt:hasConstraint :Constraint ;
+    opt:hasParameter :rows, :cols, :cost ;
+    opt:hasVariable :x .
+
+:rows a opt:Parameter ;
+    rdfs:label "Number of programmers" ;
+    rdfs:comment "The number of programmers available for assignment" ;
+    rdfs:range xsd:integer .
+
+:cols a opt:Parameter ;
+    rdfs:label "Number of jobs" ;
+    rdfs:comment "The number of jobs available for assignment" ;
+    rdfs:range xsd:integer .
+
+:cost a opt:Parameter ;
+    rdfs:label "Cost matrix" ;
+    rdfs:comment "Matrix representing the preference value of each programmer for each job" ;
+    rdfs:range xsd:array .
+
+:x a opt:Variable ;
+    rdfs:label "Assignment matrix" ;
+    rdfs:comment "Binary matrix representing the assignment of programmers to jobs" ;
+    rdfs:range xsd:array .
+
+:Constraint a opt:Constraint ;
+    rdfs:label "Assignment constraint" ;
+    rdfs:comment "Each programmer is assigned to one job and each job is assigned to one programmer" .
+
+:Objective a opt:Objective ;
+    rdfs:label "Minimize total preference" ;
+    rdfs:comment "The goal is to minimize the sum of the preference values of the programmers for the jobs they are assigned" ;
+    opt:isTypeOf opt:Minimization .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_6.ttl

@@ -0,0 +1,61 @@
+@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.semanticweb.org/ontologies/optimization#> .
+
+:MaximumFlowProblem a opt:OptimizationProblem ;
+    opt:hasObjective :Objective1 ;
+    opt:hasConstraint :Constraint1, :Constraint2 ;
+    opt:hasParameter :Parameter1, :Parameter2, :Parameter3, :Parameter4, :Parameter5, :Parameter6 ;
+    opt:hasVariable :Variable1 .
+
+:Parameter1 a opt:Parameter ;
+    rdfs:label "n" ;
+    rdfs:comment "Number of nodes in the network" ;
+    rdfs:range xsd:integer .
+
+:Parameter2 a opt:Parameter ;
+    rdfs:label "num_edges" ;
+    rdfs:comment "Number of arcs in the network" ;
+    rdfs:range xsd:integer .
+
+:Parameter3 a opt:Parameter ;
+    rdfs:label "E" ;
+    rdfs:comment "Set of arcs represented as pairs of nodes" ;
+    rdfs:range xsd:array .
+
+:Parameter4 a opt:Parameter ;
+    rdfs:label "a" ;
+    rdfs:comment "Capacities of each arc in the network" ;
+    rdfs:range xsd:array .
+
+:Parameter5 a opt:Parameter ;
+    rdfs:label "s" ;
+    rdfs:comment "Source node" ;
+    rdfs:range xsd:integer .
+
+:Parameter6 a opt:Parameter ;
+    rdfs:label "t" ;
+    rdfs:comment "Sink node" ;
+    rdfs:range xsd:integer .
+
+:Variable1 a opt:Variable ;
+    rdfs:label "flow" ;
+    rdfs:comment "Flow on each arc" ;
+    rdfs:range xsd:array .
+
+:Constraint1 a opt:Constraint ;
+    rdfs:label "Flow conservation" ;
+    rdfs:comment "The flow into a node equals the flow out of it, for all nodes except the source and sink" ;
+    opt:hasVariable :Variable1 .
+
+:Constraint2 a opt:Constraint ;
+    rdfs:label "Capacity constraint" ;
+    rdfs:comment "The flow on an arc cannot exceed its capacity" ;
+    opt:hasVariable :Variable1 .
+
+:Objective1 a opt:Objective ;
+    rdfs:label "Maximize total flow" ;
+    rdfs:comment "Maximize the total flow from the source to the sink" ;
+    opt:hasVariable :Variable1 ;
+    opt:optimizationType opt:Maximization .

text2model/knowledge_graphs/OR_LP_IP_Scheduling_problem_8.ttl

@@ -0,0 +1,54 @@
+@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 : <http://www.example.com/> .
+
+:WorkforceManagementProblem a owl:Class ;
+    rdfs:subClassOf :OptimizationProblem .
+
+:n a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:demand a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:full_time_pay a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:part_time_pay a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:full_time_shift a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:part_time_shift a owl:DatatypeProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range xsd:integer .
+
+:hasVariable a owl:ObjectProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range :Variable .
+
+:Variable a owl:Class .
+
+:hasConstraint a owl:ObjectProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range :Constraint .
+
+:Constraint a owl:Class .
+
+:hasObjective a owl:ObjectProperty ;
+    rdfs:domain :WorkforceManagementProblem ;
+    rdfs:range :Objective .
+
+:Objective a owl:Class ;
+    rdfs:subClassOf :MinimizationObjective .
+
+:MinimizationObjective a owl:Class ;
+    rdfs:subClassOf :Objective .

text2model/knowledge_graphs/combinatorial_problem_1.ttl

@@ -0,0 +1,48 @@
+@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:3GroupSplitProblem
+    rdf:type opt:OptimizationProblem ;
+    opt:hasParameter opt:n, opt:a, opt:k ;
+    opt:hasVariable opt:groupAssignment ;
+    opt:hasConstraint opt:groupSumConstraint ;
+    opt:hasObjective opt:minimizeMaxGroupSum .
+
+opt:n
+    rdf:type opt:Parameter ;
+    rdfs:label "n" ;
+    rdfs:comment "Number of items in the group" ;
+    rdfs:range xsd:integer .
+
+opt:a
+    rdf:type opt:Parameter ;
+    rdfs:label "a" ;
+    rdfs:comment "Values of the items in the group" ;
+    rdfs:range xsd:integer .
+
+opt:k
+    rdf:type opt:Parameter ;
+    rdfs:label "k" ;
+    rdfs:comment "Number of groups to split into" ;
+    rdfs:range xsd:integer .
+
+opt:groupAssignment
+    rdf:type opt:Variable ;
+    rdfs:label "groupAssignment" ;
+    rdfs:comment "Assignment of items to groups" ;
+    rdfs:range xsd:integer .
+
+opt:groupSumConstraint
+    rdf:type opt:Constraint ;
+    rdfs:label "groupSumConstraint" ;
+    rdfs:comment "The sum of the values in each group must be less than or equal to the maximum sum" ;
+    opt:relatesTo opt:groupAssignment, opt:a .
+
+opt:minimizeMaxGroupSum
+    rdf:type opt:Objective ;
+    rdfs:label "minimizeMaxGroupSum" ;
+    rdfs:comment "Minimize the maximum sum amongst all groups" ;
+    opt:relatesTo opt:groupAssignment, opt:a ;
+    opt:optimizationType opt:Minimization .

text2model/knowledge_graphs/combinatorial_problem_31.ttl

@@ -0,0 +1,43 @@
+@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.semanticweb.org/ontologies/optimization#> .
+
+:KidneyExchangeProgram rdf:type opt:OptimizationProblem ;
+    rdfs:label "Kidney Exchange Program" ;
+    opt:hasObjective :MaximizeExchanges ;
+    opt:hasConstraint :DonorReceiverBalance ;
+    opt:hasParameter :num_people, :compatible .
+
+:num_people rdf:type opt:Parameter ;
+    rdfs:label "Number of people in the kidney exchange program" ;
+    rdfs:comment "Scalar value representing the total number of people in the kidney exchange program" ;
+    rdfs:range xsd:integer .
+
+:compatible rdf:type opt:Parameter ;
+    rdfs:label "Compatibility matrix" ;
+    rdfs:comment "2D array representing the compatibility of donors for each person in the kidney exchange program" ;
+    rdfs:range xsd:array .
+
+:MaximizeExchanges rdf:type opt:Objective ;
+    rdfs:label "Maximize the number of kidney exchanges" ;
+    opt:isTypeOf opt:Maximization ;
+    opt:hasVariable :num_exchanges .
+
+:num_exchanges rdf:type opt:Variable ;
+    rdfs:label "Number of kidney exchanges" ;
+    rdfs:range xsd:integer .
+
+:DonorReceiverBalance rdf:type opt:Constraint ;
+    rdfs:label "Donor-Receiver Balance" ;
+    rdfs:comment "Every person who donates a kidney also receives one" ;
+    opt:isTypeOf opt:Equality ;
+    opt:hasVariable :num_donations, :num_receivers .
+
+:num_donations rdf:type opt:Variable ;
+    rdfs:label "Number of kidney donations" ;
+    rdfs:range xsd:integer .
+
+:num_receivers rdf:type opt:Variable ;
+    rdfs:label "Number of kidney receivers" ;
+    rdfs:range xsd:integer .

text2model/knowledge_graphs/combinatorial_problem_32.ttl

@@ -0,0 +1,39 @@
+@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.semanticweb.org/ontologies/optimization#> .
+
+:carpoolFairnessProblem a opt:OptimizationProblem ;
+    opt:hasParameter :num_days, :num_people, :participation ;
+    opt:hasVariable :driving_days ;
+    opt:hasConstraint :participationConstraint ;
+    opt:hasObjective :minimizeDifferenceObjective .
+
+:num_days a opt:Parameter ;
+    rdfs:label "num_days" ;
+    rdfs:comment "Number of days in the carpooling schedule" ;
+    rdfs:range xsd:integer .
+
+:num_people a opt:Parameter ;
+    rdfs:label "num_people" ;
+    rdfs:comment "Number of people participating in the carpool" ;
+    rdfs:range xsd:integer .
+
+:participation a opt:Parameter ;
+    rdfs:label "participation" ;
+    rdfs:comment "Array representing the participation of each person on each day of the carpool. Value 1 indicates participation, and value 0 indicates non-participation." ;
+    rdfs:range xsd:array .
+
+:driving_days a opt:Variable ;
+    rdfs:label "driving_days" ;
+    rdfs:comment "Array representing the driving responsibilities of each person on each day of the carpool." ;
+    rdfs:range xsd:array .
+
+:participationConstraint a opt:Constraint ;
+    rdfs:label "participationConstraint" ;
+    rdfs:comment "The driving responsibilities should be allocated based on the number of participants each day." .
+
+:minimizeDifferenceObjective a opt:Objective ;
+    rdfs:label "minimizeDifferenceObjective" ;
+    rdfs:comment "Minimize the differences between the actual driving days and the obligations to achieve a fair schedule." ;
+    opt:isMinimizationObjective true .

text2model/knowledge_graphs/combinatorial_problem_7.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 opt: <http://www.semanticweb.org/ontologies/optimizationProblem#> .
+
+opt:CombinatorialAuctionProblem
+    rdf:type owl:Class ;
+    rdfs:subClassOf opt:OptimizationProblem ;
+    rdfs:comment "Combinatorial auction problem where bidders can give bids for sets of items. The auctioneer needs to generate an optimal selection that maximizes revenue."@en .
+
+opt:num_items
+    rdf:type owl:DatatypeProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of items available in the auction."@en .
+
+opt:max_item
+    rdf:type owl:DatatypeProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Maximum item in the auction."@en .
+
+opt:num_bids
+    rdf:type owl:DatatypeProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range xsd:integer ;
+    rdfs:comment "Number of bids in the auction."@en .
+
+opt:packages
+    rdf:type owl:DatatypeProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range xsd:array ;
+    rdfs:comment "Binary Matrix containing the packages (sets of items) for each bid, 0 if contained, 1 if not."@en .
+
+opt:bids
+    rdf:type owl:DatatypeProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range xsd:array ;
+    rdfs:comment "Array containing the bid amount for each bid."@en .
+
+opt:hasObjective
+    rdf:type owl:ObjectProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range opt:Objective ;
+    rdfs:comment "The objective of the combinatorial auction problem is to maximize the total bid amount."@en .
+
+opt:hasConstraint
+    rdf:type owl:ObjectProperty ;
+    rdfs:domain opt:CombinatorialAuctionProblem ;
+    rdfs:range opt:Constraint ;
+    rdfs:comment "The constraint of the combinatorial auction problem is that any two bids in the subset do not share an item."@en .

text2model/knowledge_graphs/complexor_AircraftAssignment.ttl

@@ -0,0 +1,73 @@
+@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 : <http://www.example.com/> .
+
+:TotalAircraft a rdf:Property ;
+    rdfs:label "TotalAircraft" ;
+    rdfs:domain :AircraftAssignmentProblem ;
+    rdfs:range xsd:integer .
+
+:TotalRoutes a rdf:Property ;
+    rdfs:label "TotalRoutes" ;
+    rdfs:domain :AircraftAssignmentProblem ;
+    rdfs:range xsd:integer .
+
+:Availability a rdf:Property ;
+    rdfs:label "Availability" ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:Demand a rdf:Property ;
+    rdfs:label "Demand" ;
+    rdfs:domain :Route ;
+    rdfs:range xsd:integer .
+
+:Capacity a rdf:Property ;
+    rdfs:label "Capacity" ;
+    rdfs:domain :AircraftRouteCombination ;
+    rdfs:range xsd:integer .
+
+:Costs a rdf:Property ;
+    rdfs:label "Costs" ;
+    rdfs:domain :AircraftRouteCombination ;
+    rdfs:range xsd:integer .
+
+:AircraftAssignmentProblem a rdfs:Class ;
+    rdfs:label "Aircraft Assignment Problem" ;
+    rdfs:subClassOf :OptimizationProblem .
+
+:Aircraft a rdfs:Class ;
+    rdfs:label "Aircraft" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .
+
+:Route a rdfs:Class ;
+    rdfs:label "Route" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .
+
+:AircraftRouteCombination a rdfs:Class ;
+    rdfs:label "Aircraft Route Combination" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .
+
+:OptimizationProblem a rdfs:Class ;
+    rdfs:label "Optimization Problem" .
+
+:MinimizeTotalCost a :Objective ;
+    rdfs:label "Minimize Total Cost" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .
+
+:Objective a rdfs:Class ;
+    rdfs:label "Objective" ;
+    rdfs:subClassOf :OptimizationProblem .
+
+:Constraint a rdfs:Class ;
+    rdfs:label "Constraint" ;
+    rdfs:subClassOf :OptimizationProblem .
+
+:AvailabilityConstraint a :Constraint ;
+    rdfs:label "Availability Constraint" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .
+
+:DemandConstraint a :Constraint ;
+    rdfs:label "Demand Constraint" ;
+    rdfs:subClassOf :AircraftAssignmentProblem .

text2model/knowledge_graphs/complexor_AircraftLanding.ttl

@@ -0,0 +1,53 @@
+@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 : <http://www.example.com/aircraftlandingproblem#> .
+
+:TotalAircrafts a owl:DatatypeProperty ;
+    rdfs:domain :AircraftLandingProblem ;
+    rdfs:range xsd:integer .
+
+:EarliestLandingTime a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:LatestLandingTime a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:TargetLandingTime a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:PenaltyTimeAfterTarget a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:PenaltyTimeBeforeTarget a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:SeparationTimeMatrix a owl:DatatypeProperty ;
+    rdfs:domain :Aircraft ;
+    rdfs:range xsd:integer .
+
+:Aircraft a owl:Class ;
+    rdfs:subClassOf :AircraftLandingProblem .
+
+:AircraftLandingProblem a owl:Class ;
+    rdfs:subClassOf :OptimizationProblem .
+
+:OptimizationProblem a owl:Class ;
+    rdfs:subClassOf :Problem .
+
+:Problem a owl:Class .
+
+:Constraint a owl:Class ;
+    rdfs:subClassOf :Problem .
+
+:Objective a owl:Class ;
+    rdfs:subClassOf :Problem .
+
+:Variable a owl:Class ;
+    rdfs:subClassOf :Problem .