Stable Generated Models of Generalized Constraint Logic Programs
In Proc. of the International Workshop on Functional and (Constraint) Logic Programming (WFLP 2001)
, Report No. 2017, University of Kiel
We present a declarative semantics of generalized
constraint logic programs based on stable generated models.
Stable generated models were introduced by Herre and Wagner
for generalized programs containing quantifier free formulas in
body and head of their rules.
This definition is quite general and can be applied naturally
to other classes of logic programs.
A generalized constraint logic program contains additional
constraints in the bodies of its rules. It combines the expressive
power of constraint logic programs and generalized logic programs.
We define stable generated models of generalized constraint
logic programs and describe some properties.
This provides a declarative semantics of this program class that
extends naturally the least constraint-model semantics for definite
programs with constraints defined by Jaffar et al.