Partial Stable Generated Models of Generalized Logic Programs with Constraints

摘要

Generalized logic programs. (GLP) are sets of rules with arbitrary quantifier free formulas in their bodies and heads. Well-known program classes, such as definite, normal and disjunctive programs, are syntactically restricted special cases of GLP. Combining this program class with the advantages of the additional use of constraints in the bodies of the rules results in the very expressive language -GLP, appropriate to solve complex knowledge representation tasks.