Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications
<p>This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and for a variety of other applications. Datalog+/- extends plain Datalog by features such as existentially quantified rule...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
IEEE
2010
|
| _version_ | 1826290845857349632 |
|---|---|
| author | Calì, A Gottlob, G Lukasiewicz, T Marnette, B Pieris, A |
| author_facet | Calì, A Gottlob, G Lukasiewicz, T Marnette, B Pieris, A |
| author_sort | Calì, A |
| collection | OXFORD |
| description | <p>This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and for a variety of other applications. Datalog+/- extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In particular, we discuss three paradigms ensuring decidability: chase termination, guardedness, and stickiness.</p> |
| first_indexed | 2024-03-07T02:50:26Z |
| format | Conference item |
| id | oxford-uuid:ad82a5c5-8ec4-4bfb-9411-8c06efbba994 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T02:50:26Z |
| publishDate | 2010 |
| publisher | IEEE |
| record_format | dspace |
| spelling | oxford-uuid:ad82a5c5-8ec4-4bfb-9411-8c06efbba9942022-03-27T03:35:59ZDatalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New ApplicationsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:ad82a5c5-8ec4-4bfb-9411-8c06efbba994Department of Computer ScienceIEEE2010Calì, AGottlob, GLukasiewicz, TMarnette, BPieris, A<p>This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and for a variety of other applications. Datalog+/- extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In particular, we discuss three paradigms ensuring decidability: chase termination, guardedness, and stickiness.</p> |
| spellingShingle | Calì, A Gottlob, G Lukasiewicz, T Marnette, B Pieris, A Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title | Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title_full | Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title_fullStr | Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title_full_unstemmed | Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title_short | Datalog+⁄−: A Family of Logical Knowledge Representation and Query Languages for New Applications |
| title_sort | datalog a family of logical knowledge representation and query languages for new applications |
| work_keys_str_mv | AT calia datalogafamilyoflogicalknowledgerepresentationandquerylanguagesfornewapplications AT gottlobg datalogafamilyoflogicalknowledgerepresentationandquerylanguagesfornewapplications AT lukasiewiczt datalogafamilyoflogicalknowledgerepresentationandquerylanguagesfornewapplications AT marnetteb datalogafamilyoflogicalknowledgerepresentationandquerylanguagesfornewapplications AT pierisa datalogafamilyoflogicalknowledgerepresentationandquerylanguagesfornewapplications |