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
Democratizing Constraint Satisfaction Problems through Machine Learning
KU Leuven, Belgium.
KU Leuven, Belgium.
KU Leuven, Belgium.
KU Leuven, Belgium. (AASS)ORCID iD: 0000-0002-6860-6303
2021 (English)In: Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, Vol. 35:18, p. 16057-16059Conference paper, Published paper (Refereed)
Abstract [en]

Constraint satisfaction problems (CSPs) are used widely, especially in the field of operations research, to model various real world problems like scheduling or planning. However, modelling a problem as a CSP is not trivial, it is labour intensive and requires both modelling and domain expertise. The emerging field of constraint learning deals with this problem by automatically learning constraints from a given dataset. While there are several interesting approaches for constraint learning, these works are hard to access for a non-expert user. Furthermore, different approaches have different underlying formalism and require different setups before they can be used. This demo paper combines these researches and brings it to non-expert users in the form of an interactive Excel plugin. To do this, we translate different formalism for specifying CSPs into a common language, which allows multiple constraint learners to coexist, making this plugin more powerful than individual constraint learners. Moreover, we integrate learning of CSPs from data with solving them, making it a self sufficient plugin. For the developers of different constraint learners, we provide an API that can be used to integrate their work with this plugin by implementing a handful of functions.

Place, publisher, year, edition, pages
AAAI Press, 2021. Vol. 35:18, p. 16057-16059
Series
Proceedings of the AAAI Conference on Artificial Intelligence, ISSN 2159-5399, E-ISSN 2374-3468 ; 35(18)
Keywords [en]
Constraint Learning, Constraint Satisfaction Problem
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-96662ISI: 000681269807212ISBN: 9781577358664 (print)OAI: oai:DiVA.org:oru-96662DiVA, id: diva2:1631660
Conference
35th AAAI Conference on Artificial Intelligence (AAAI 2021), (Virtual conference), February 2-9, 2021
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Note

Funding agencies:

European Research Council (ERC) 694980  

Data-driven logistics project FWO-S007318N

Flemish government (AI research program)

Available from: 2022-01-24 Created: 2022-01-24 Last updated: 2022-01-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Free full text

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 39 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