Title: Detection and exploitation of functional dependencies for model generation
Authors: De Cat, Broes ×
Bruynooghe, Maurice #
Issue Date: Sep-2013
Publisher: Cambridge University Press
Series Title: Theory and Practice of Logic Programming vol:13 issue:4-5 pages:471-485
Conference: International Conference on Logic Programming edition:29 location:Istanbul date:24-29 Aug 2013
Abstract: Recent work in Answer Set Programming has integrated ideas from Constraint Programming. This has led to a new field called ASP Modulo CSP (CASP), in which the ASP language is enriched with constraint atoms representing constraint satisfaction problems. These constraints have a more compact grounding and are handled by a new generation of search algorithms. However, the burden is on the modeler to exploit these new constructs in his declarative problem specifications. Here, we explore how to remove this burden by automatically generating constraint atoms. We do so in the context of FO(·)-IDP, a knowledge representation language that extends first-order logic with, among others, inductive definitions, arithmetic and aggregates. We uncover functional dependencies in declarative problem specifications with a theorem prover and exploit them with a transformation that introduces functions. Experimental evaluation shows that we obtain more compact groundings and better search performance.
ISSN: 1471-0684
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
paper.pdf Published 442KbAdobe PDFView/Open
appendix.pdfAppendix Published 306KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science