3434import torch
3535from owlapy import dl_to_owl_expression
3636
37+ import logging
3738from owlapy .class_expression import OWLThing
3839from owlapy .owl_individual import OWLNamedIndividual
3940from owlapy .render import DLSyntaxObjectRenderer
4445from ontolearn .refinement_operators import NERORefinement
4546from ontolearn .utils .static_funcs import compute_f1_score
4647
48+ logger = logging .getLogger (__name__ )
49+
4750# =============================================================================
4851# NERO Main Class
4952# =============================================================================
@@ -118,8 +121,8 @@ def __init__(self,
118121 self ._is_trained = False
119122
120123 if self .verbose > 0 :
121- print (f"NERO initialized with { self .neural_architecture } architecture" )
122- print (f"Device: { self .device } " )
124+ logger . info (f"NERO initialized with { self .neural_architecture } architecture" )
125+ logger . info (f"Device: { self .device } " )
123126
124127 def _initialize_instance_mapping (self ):
125128 """Initialize mapping from individuals to indices."""
@@ -135,7 +138,7 @@ def _initialize_refinement_operator(self):
135138 """Initialize the refinement operator."""
136139 if self .refinement_op is None :
137140 if self .verbose > 0 :
138- print ("Initializing refinement operator..." )
141+ logger . info ("Initializing refinement operator..." )
139142 self .refinement_op = NERORefinement (self .kb )
140143 self .expression .update (self .refinement_op .expressions )
141144
@@ -197,7 +200,7 @@ def train(self, learning_problems: List[Tuple[List[str], List[str]]]):
197200 learning_problems: List of (positive_examples, negative_examples) tuples
198201 """
199202 if self .verbose > 0 :
200- print ("Training NERO model..." )
203+ logger . info ("Training NERO model..." )
201204
202205 start_time = time .time ()
203206
@@ -276,22 +279,22 @@ def train(self, learning_problems: List[Tuple[List[str], List[str]]]):
276279 epoch_loss += loss .item ()
277280
278281 if self .verbose > 0 and (epoch + 1 ) % 10 == 0 :
279- print (f"Epoch { epoch + 1 } /{ self .num_epochs } , Loss: { epoch_loss :.4f} " )
282+ logger . info (f"Epoch { epoch + 1 } /{ self .num_epochs } , Loss: { epoch_loss :.4f} " )
280283
281284 self .model .eval ()
282285 self ._is_trained = True
283286
284287 if self .verbose > 0 :
285288 training_time = time .time () - start_time
286- print (f"Training completed in { training_time :.2f} seconds" )
289+ logger . info (f"Training completed in { training_time :.2f} seconds" )
287290
288291 def search (self , pos : Set [str ], neg : Set [str ], top_k : int = 10 , max_child_length : int = 10 , max_queue_size : int = 10000 ) -> Dict :
289292 """
290293 Perform reinforcement learning-based search for complex class expressions.
291294 Uses neural predictions to initialize and guide the search.
292295 """
293296 if self .verbose > 0 :
294- print ("Starting reinforcement learning search..." )
297+ logger . info ("Starting reinforcement learning search..." )
295298
296299 start_time = time .time ()
297300 self .search_tree = SearchTree ()
@@ -346,8 +349,8 @@ def search(self, pos: Set[str], neg: Set[str], top_k: int = 10, max_child_length
346349 best_hypothesis = expr
347350
348351 if self .verbose > 0 :
349- print (f"Initial best hypothesis: { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
350- print (f"Initial queue size: { len (self .search_tree .gate )} " )
352+ logger . info (f"Initial best hypothesis: { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
353+ logger . info (f"Initial queue size: { len (self .search_tree .gate )} " )
351354
352355 # Iterative refinement-based search
353356 iteration = 0
@@ -364,8 +367,7 @@ def search(self, pos: Set[str], neg: Set[str], top_k: int = 10, max_child_length
364367
365368 queue_size = self .search_tree .items_in_queue .qsize ()
366369 if queue_size > max_queue_size :
367- if self .verbose > 0 :
368- print (f"WARNING: Queue size ({ queue_size } ) exceeded max. Stopping search." )
370+ logger .warning (f"Queue size ({ queue_size } ) exceeded max. Stopping search." )
369371 break
370372
371373 try :
@@ -403,12 +405,12 @@ def search(self, pos: Set[str], neg: Set[str], top_k: int = 10, max_child_length
403405 best_quality = quality
404406 best_hypothesis = next_concept
405407 if self .verbose > 1 :
406- print (f"New best at iter { iteration } : { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
408+ logger . debug (f"New best at iter { iteration } : { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
407409
408410 # Early stopping if perfect solution found
409411 if quality >= 1.0 :
410412 if self .verbose > 0 :
411- print (f"Perfect solution found at iteration { iteration } " )
413+ logger . info (f"Perfect solution found at iteration { iteration } " )
412414 runtime = time .time () - start_time
413415 return {
414416 'Prediction' : best_hypothesis .name ,
@@ -419,20 +421,20 @@ def search(self, pos: Set[str], neg: Set[str], top_k: int = 10, max_child_length
419421 except (AttributeError , KeyError , Exception ) as e :
420422 # Skip concepts that cause errors during evaluation
421423 if self .verbose > 1 :
422- print (f"Skipping concept due to error: { e } " )
424+ logger . debug (f"Skipping concept due to error: { e } " )
423425 continue
424426
425427 if iteration % 10 == 0 :
426428 time .sleep (0.001 )
427429
428430 if self .verbose > 0 and iteration % 1000 == 0 :
429431 elapsed = time .time () - start_time
430- print (f"Iter { iteration } , Queue: { queue_size } , Best: { best_quality :.3f} , Time: { elapsed :.1f} s" )
432+ logger . info (f"Iter { iteration } , Queue: { queue_size } , Best: { best_quality :.3f} , Time: { elapsed :.1f} s" )
431433
432434 runtime = time .time () - start_time
433435 if self .verbose > 0 :
434- print (f"Search finished in { runtime :.2f} s after { iteration } iterations." )
435- print (f"Best: { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
436+ logger . info (f"Search finished in { runtime :.2f} s after { iteration } iterations." )
437+ logger . info (f"Best: { best_hypothesis .name } (Quality: { best_quality :.3f} )" )
436438
437439 return {
438440 'Prediction' : best_hypothesis .name ,
0 commit comments