Edinburgh Research Explorer

Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Related Edinburgh Organisations

Open Access permissions

Open

Documents

https://link.springer.com/chapter/10.1007/978-3-319-53733-7_2
Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications
Subtitle of host publicationInternational Conference on Language and Automata Theory and Applications (LATA 2017)
PublisherSpringer International Publishing
Pages27-47
Number of pages21
ISBN (Electronic)978-3-319-53733-7
ISBN (Print)978-3-319-53732-0
DOIs
Publication statusPublished - 16 Feb 2017
Event11th International Conference on Language and Automata Theory and Applications
- Umea, Sweden
Duration: 6 Mar 20179 Mar 2017
http://grammars.grlmc.com/LATA2017/

Publication series

NameLecture Notes in Computer Science (LNCS)
PublisherSpringer International Publishing
Volume10168
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Language and Automata Theory and Applications
Abbreviated titleLATA 2017
CountrySweden
CityUmea
Period6/03/179/03/17
Internet address

Abstract

This paper gives a short overview of specific logical approaches to data extraction, data management, and reasoning about data. In particular, we survey theoretical results and formalisms that have been obtained and used in the context of the Lixto Project at TU Wien, the DIADEM project at the University of Oxford, and the VADA project, which is currently being carried out jointly by the universities of Edinburgh, Manchester, and Oxford. We start with a formal approach to web data extraction rooted in monadic second order logic and monadic Datalog, which gave rise to the Lixto data extraction system. We then present some complexity results for monadic Datalog over trees and for XPath query evaluation. We further argue that for value creation and for ontological reasoning over data, we need existential quantifiers (or Skolem terms) in rule heads, and introduce the Datalog±± family. We give an overview of important members of this family and discuss related complexity issues.

Event

Download statistics

No data available

ID: 31832799