Application of Constraint Propagation Techniques to Speed up Processing of Queries to Ontologies | Zendy

Alexander Anatolievich Zuenko | Zendy; Павел Ломов | Zendy; Andry Gigorievich Oleynik | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Application of Constraint Propagation Techniques to Speed up Processing of Queries to Ontologies

Author(s) -

Alexander Anatolievich Zuenko,

Павел Ломов,

Andry Gigorievich Oleynik

Publication year - 2016

Publication title -

spiiras proceedings

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 9

eISSN - 2078-9599

pISSN - 2078-9181

DOI - 10.15622/sp.50.5

Subject(s) - computer science , ontology , constraint satisfaction problem , representation (politics) , constraint (computer aided design) , constraint satisfaction , constraint programming , theoretical computer science , speedup , reduction (mathematics) , sparql , dimension (graph theory) , local consistency , rdf , information retrieval , artificial intelligence , semantic web , mathematical optimization , mathematics , parallel computing , geometry , philosophy , epistemology , politics , probabilistic logic , political science , stochastic programming , law , pure mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research