As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
The article considers ontology as a set of relations (unary and binary) which are represented by specialized matrix like structures – C-systems. That allows us to consider tasks of inference on ontologies as constraint satisfaction problems. A method of a priori analysis and transformation of SPARQL queries patterns into a form which speeds up the subsequent execution of concrete user queries has been developed. The method is oriented on ontologies developed with using content ontology design patterns, that ensures the predictability of the structure of potential queries. The method is based on the combining of the methods of structural decomposition and the original methods for non-numerical constraints satisfaction.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.