Logic programs with classical negation
Logic programming
Rational default logic and disjunctive logic programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Alternative approaches to default logic
Artificial Intelligence
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Computing Non-Ground Representations of Stable Models
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
A Formal Basis for Consistency, Evolution and Rationale Management in Requirements Engineering
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
| Hi-index | 0.00 |
Recent research on the integration of the abductive and constraint logic programming paradigms has led to systems which are both expressive and computationally efficient. This paper investigates the role of constraints in integrity checking in the context of such systems. Providing support for constraints in this role leads to a framework that is significantly more expressive, without significant loss in efficiency. We augment the Abductive Constraint Logic Programming framework with assumed constraints and provide model- and proof-theoretic accounts of two variants: one which involves commitment to such assumptions, and one which does not. We also show that such accounts extend easily to a constraint logic programming framework which supports both negation and assumed constraints. The gains in expressivity in these frameworks turn out to be particularly useful in a variety of application domains, including scheduling and constraint database updates.