Conjunctive query

Conjunctive query

Web Ontology Language OWL

Published in Umberto Straccia, Foundations of Fuzzy Logic and Semantic Web Languages, 2016

Proposition 14 ([82]).Satisfiability of a KB K can be decided in time polynomial in the size of 𝒦. Conjunctive query answering is in LogSpace in data complexity, while is NP-complete in combined complexity.

An expressive and tractable rule-based description language

View Article

Journal Information

Published in Enterprise Information Systems, 2019

Linh Anh Nguyen, Ngoc-Thanh Nguyen

The first one would result in a more efficient method that can work on large knowledge bases and can deal with more sophisticated queries (a conjunctive query is a conjunction of literals of the form or , where and are variables standing for individuals). The second and third directions would result in tractable rule-based description languages that are more useful for practical applications, as they can deal with nonmonotonic reasoning and fuzzy reasoning, respectively.

Explore chapters and articles related to this topic

Web Ontology Language OWL

An expressive and tractable rule-based description language