منابع مشابه
Hoare Logic for Graph Programs
We present a new approach for verifying programs written in GP (for Graph Programs), an experimental programming language for performing computations on graphs at a high level of abstraction. Taking a labelled graph as input, a graph program nondeterministically applies to it a number of graph transformation rules, directed by simple control constructs such as sequential composition and as-long...
متن کامل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 ...
متن کاملGraph representations of logic programs: properties and comparison
In this paper, we propose a formalization of the features that a graph representation of logic programs under the answer set semantics should in our opinion exhibit in order to be a satisfactory and useful representation formalism. We introduce a concept of isomorphism between a program and the corresponding graph. We show the importance of isomorphism for program analysis and we compare differ...
متن کاملSome Properties of Invers Resolution in Normal Logic Programs
This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs. In the presence of negation as failure in a program, however, the V-operators do not work as generalization operations in general and often make a consistent program inconsistent. Moreover, they may destroy the syntact...
متن کامل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
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90172-p