A logical semantics for depth-first prolog with ground negation
نویسندگان
چکیده
منابع مشابه
A Logical Semantics for Depth-First Prolog with Ground Negation
A sound and complete semantics is given for sequential, depth-rst logic programming with a version of negation as failure. The semantics is logical in the sense that it is built up only from valuation functions (multi-valued logic interpretations in the style of Fitting and Kunen) and logically-motivated equivalence relations between formulas. The notion of predicate folding and unfolding with ...
متن کاملA Multiple-Valued Logical Semantics for Prolog
Abs t rac t . The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a new semantics for Prolog programs based on a new fourvalued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice prope...
متن کاملTowards a Logical Semantics for Pure Prolog
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-rst left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarativ...
متن کاملFirst-order theories for pure Prolog programs with negation
The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the `-completion and the inductive extension of a logic program. Both are first-order theories in a language with operators for success, failure and termination of goals. The `-c...
متن کاملA Logical Encoding of Well-Founded Semantics with Explicit Negation
In this work we revisit a previously obtained logical characterization of Well-Founded Semantics (WFS) and show now its application to Alferes and Pereira’s WFS variant (WFSX) for programs with explicit negation. In a previous work, we presented a full logical treatment of program connectives by interpreting them in an intermediate logic (we called two-dimensional here-and-there, HT ). This log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00138-7