Detection and exploitation of functional dependencies for model generation
| Autor: | Broes De Cat, Maurice Bruynooghe |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Concurrent constraint logic programming
Knowledge representation and reasoning Computer science Programming language business.industry Knowledge Representation Constraint satisfaction Machine learning computer.software_genre Inductive programming Constraint Programming Theoretical Computer Science First-order logic Computational Theory and Mathematics Artificial Intelligence Hardware and Architecture Model generation Constraint logic programming Constraint programming Artificial intelligence Functional dependency business computer Software |
| Zdroj: | Theory and Practice of Logic Programming. 13:471-485 |
| ISSN: | 1475-3081 1471-0684 |
| DOI: | 10.1017/s147106841300029x |
| Popis: | 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. ispartof: Theory and Practice of Logic Programming vol:13 issue:4 pages:471-485 ispartof: location:Istanbul status: published |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|