Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
Next revisionBoth sides next revision
define_computables [2012/12/01 13:11] – [Define computables] tenorthdefine_computables [2013/02/12 17:41] – external edit 127.0.0.1
Line 43: Line 43:
 The whole code for managing the computables is contained in rdfs_computable.pl in the module semweb. The whole code for managing the computables is contained in rdfs_computable.pl in the module semweb.
  
-=== Caveats ===+===== Caveats =====
  
 When something does not work, check the following. Most likely, there is a minor inconsistency in the OWL names that makes the whole process break. When something does not work, check the following. Most likely, there is a minor inconsistency in the OWL names that makes the whole process break.
Line 154: Line 154:
 Here, we do not have the frame/value scheme, but rather one command for creating instances (command) and one for checking if an instance belongs to the respective class (testCommand). Here, we do not have the frame/value scheme, but rather one command for creating instances (command) and one for checking if an instance belongs to the respective class (testCommand).
  
-==== Prolog classes ====+===== Prolog classes =====
  
 The definition of computable prolog classes is similar to the preceding ones, you simply need to describe the class (here: DrinkingMug) and a binary predicate (here: comp_objectsOnTable(Inst, Class) ) that computes either instances of a class of the class of an instance. The definition of computable prolog classes is similar to the preceding ones, you simply need to describe the class (here: DrinkingMug) and a binary predicate (here: comp_objectsOnTable(Inst, Class) ) that computes either instances of a class of the class of an instance.