Conference item icon

Conference item

Query answering with transitive and linear-ordered data

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 relation to be a linear order. We give some natural generalizations of guardedness that allow inference to be decidable in each case, and isolate the complexit...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Name:
Engineering and Physical Sciences Research Council
Funding agency for:
Vanden Boom, M
Benedikt, M
Grant:
EP/L012138/1
EP/M005852/1
EP/L012138/1
Publisher:
International Joint Conferences on Artificial Intelligence
Host title:
IJCAI 2016: 25th International Joint Conference on Artificial Intelligence
Journal:
IJCAI 2016: 25th International Joint Conference on Artificial Intelligence More from this journal
Publication date:
2016-07-01
Acceptance date:
2016-04-05
Pubs id:
pubs:616303
UUID:
uuid:0c326fa9-3a28-44ab-a589-69d36caf9256
Local pid:
pubs:616303
Source identifiers:
616303
Deposit date:
2016-04-18

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP