This paper describes an integration of finite domain constraint programming techniques into mathematical programming, with an implementation of this new solution approach based on a commercial linear mixed-integer tool and a finite domain CP solver over unions of integer intervals. The combined mode
Integrating answer set programming and constraint logic programming
β Scribed by Veena S. Mellarkod; Michael Gelfond; Yuanlin Zhang
- Publisher
- Springer Netherlands
- Year
- 2008
- Tongue
- English
- Weight
- 659 KB
- Volume
- 53
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi
We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulae can be labelled with temporal information using annotations. In this way we avoid the proliferation
This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving. This integra