To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Learning constraints in spreadsheets and tabular data
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium.
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium.
Department of Business Technology and Operations, VUB, Belgium; Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium .
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium.ORCID iD: 0000-0002-6860-6303
2017 (English)Conference paper, Oral presentation with published abstract (Refereed)
Abstract [en]

Spreadsheets, comma separated value files and other tabular data representations are in wide use today. However, writing, maintaining and identifying good formulas for tabular data and spreadsheets can be time consuming and error-prone. We investigate the automatic learning of constraints (formulas and relations) in raw tabular data in an unsupervised way. We represent common spreadsheet formulas and relations through predicates and expressions whose arguments must satisfy the inherent properties of the constraint. The challenge is to automatically infer the set of constraints that is present in the data, without labeled examples or user feedback. We propose a two-stage generate and test method where the first stage uses constraint solving techniques to efficiently reduce the number of candidates, based on the predicate signatures. Our approach takes inspiration from inductive logic programming, constraint learning and constraint satisfaction. We show that we are able to accurately discover constraints in spreadsheets from various sources.

Place, publisher, year, edition, pages
2017.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:oru:diva-97116OAI: oai:DiVA.org:oru-97116DiVA, id: diva2:1633989
Conference
Inductive Logic Programming conference (ILP 2017), Orléans, France, September 4-6, 2017
Available from: 2022-02-01 Created: 2022-02-01 Last updated: 2022-02-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf