=Paper= {{Paper |id=Vol-1459/invitedTalk |storemode=property |title=None |pdfUrl=https://ceur-ws.org/Vol-1459/invitedTalk.pdf |volume=Vol-1459 }} ==None== https://ceur-ws.org/Vol-1459/invitedTalk.pdf
  A framework for data, knowledge, and
          reasoning: Datalog±

                             Georg Gottlob

   Department of Computer Science, St John’s College, Oxford, UK
                   georg.gottlob@cs.ox.ac.uk



Abstract. Datalog± is a family of logic programming languages for data
manipulation, knowledge representation and reasoning. These languages
extend Datalog with features such as existential quantifiers, equalities,
and the falsum in rule heads and negation in rule bodies, and, at the same
time, apply restrictions in order to to achieve decidability and tractabil-
ity. This talk will start with a general overview of the Datalog± family
and its main decidability paradigms and an explanation of how tractable
classes can be achieved. Subsequently, some more specialized issues will
be dealt with such as nonmonotonic negation and disjunction. We will
also report about a special version of Datalog± suitable for ontologi-
cal reasoning, reasoning with reverse-engineered UML class diagrams,
and about the TriQ language that expresses SPARQL with entailment
regimes.