Query Answering with Transitive and Linear-Ordered Data

    IJCAI, pp. 893-899, 2016.

    Cited by: 12|Bibtex|Views0|Links
    EI

    Abstract:

    We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be transitive, restricting a relation to be the transitive closure of another relation, and restricting a re...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments