Inference conjunctive queries

A description logic system supports two main kinds of inference: subsumption and query answering. Subsumption: Given two concepts, C and D, the fundamental 
We study the complexity of computing a query on a probabilistic database. We consider unions of conjunctive queries, UCQ, which are equivalent to positive, 

How to get rid of equality atoms in a conjunctive query?

It is possible to get rid of equality atoms in a conjunctive query if the query is satisfiable i.e., there exists some instance on which the query returns a non-empty answer.
All the queries in CQ are satisfiable (take the canonical instance).


Categories

Join conjunctive queries
Union of conjunctive queries
Equivalence of conjunctive queries
Evaluation of conjunctive queries
Theory of conjunctive queries
Conjunctive queries equality
Conjunctive query answering
Conjunctive query algorithm
Conjunctive conjunction examples
Contact me if you have any queries
Ovsdb-client query example
Conjunctive queries
Conjunctive query containment
Conjunctive query combine complexity
Contact us if you have any queries
Concur support contact
Request.querystring not working
Conjunctive query evaluation
Query email example
Explain responding to queries