Transforming normal logic programs to constraint logic programs
نویسندگان
چکیده
منابع مشابه
Transforming Normal Logic Programs to Constraint Logic Programs
A normal logic program P is transformed to another P’” by a bottom-up computation on the positive component of P while the negative counterpart is left untouched. The declarative semantics of P is given by the completion of P’“. The completed predicate definitions in P’“, if they do not contain local variables, can be used as a basis for expanding each negated atom in the bodies of P”‘. We show...
متن کاملVerification of Imperative Programs by Transforming Constraint Logic Programs
We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP). We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say prog, as the negati...
متن کاملTransforming Abductive Logic Programs to Disjunctive Programs
A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملReduction of Abductive Logic Programs to Normal Logic Programs
In this paper we study a form of abductive logic programming which combines default and non-default abducibles and employs retractibles in integrity constraints. We also present a transformation from abductive to normal logic programs, which is correct and complete with respect to many semantics. These are all the semantics that can be formulated in an argumentation framework. A simpliied form ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90286-o