Dealing with Incomplete Knowledge on CLP(FD) Variable Domains (2003)
by
Marco Gavanelli
,
Evelina Lamma
,
Paola Mello
,
Michela Milano
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 4 - 2 self |
BibTeX
@ARTICLE{Gavanelli03dealingwith,
author = {Marco Gavanelli and Evelina Lamma and Paola Mello and Michela Milano},
title = {Dealing with Incomplete Knowledge on CLP(FD) Variable Domains},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2003},
volume = {27},
pages = {2005}
}
OpenURL
Abstract
Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and must be acquired or computed.







