A transformational approach to negation in logic programming

Barbuti, Roberto; Mancarella, Paolo; Pedreschi, Dino; Turini, Franco

doi:10.1016/0743-1066(90)90023-x

Cited by 58 publications

(51 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Splitting is a simple transformation technique where the failure axiom(s) of the predicate definition occurring negatively in the source program are split into new clauses according to a covering [17,30] of the underlying signature and then executed in an opportune inference system. This is similar to the method in [5] and ancestors (see Section 6 for a comparison).…”

Section: Introductionmentioning

confidence: 87%

“…Therefore, we will assume that local variables are restricted to occur only in a single literal in the body of a clause, similarly to condition (d) in Barbuti's definition of flat programs [5]. This can always be achieved by a simple/oWing step that can be demonstrated to be semantics preserving.…”

Section: Notice That -Iswm(00 S(v))\ ->T(00s(j)) £ F(-((0 S(0)mentioning

confidence: 99%

“…soundness and completeness, namely enlightening the role of regularity for the latter (point (b) in 4.2)). In Section 5, we introduce the idea of constructive negation via regular splitting to overcome some of these problems and we relate it with the already developed notion of intensional negation [5].…”

Section: Proof-theoretic Analysis Of Nfmentioning

confidence: 99%

“…In particular, we shall be concerned with the transformational approach initiated in [5], also known as intensional negation [26,30,7].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Regular search spaces and constructive negation

Momigliano

Ornaghi

1997

Journal of Logic and Computation

View full text Add to dashboard Cite

The aim of this paper is to show the fruitfulness and fecundity of the authors' proof-theoretic analysis of logic programming (both for definite and normal programs). It is based on a simple logical framework that goes under the name of regular search spaces. The challenge faced here is to give a treatment in proof-theoretic terms of the issue of negation, which has been one of the toughest problems that has plagued logic programming from its very beginning. While negation-as-failure (NF) has been overwhelmingly the more widespread answer, its intrinsic limitations have made it a rather unsatisfactory solution. In the present paper it is first contended that the notion of regularity offers a better understanding of the traditional theory of NF, and second a firm yet very simple and natural basis for a form of constructive negation, in the sense of Chan, Stuckey and Harland. A version of constructive negation is presented, based on the notion of regular splitting, a transformation technique where the failure axiom(s) of a predicate occurring negatively in a program are split into new clauses according to a covering of the underlying signature.

show abstract

Section: Introductionmentioning

confidence: 87%

Section: Notice That -Iswm(00 S(v))\ ->T(00s(j)) £ F(-((0 S(0)mentioning

confidence: 99%

Section: Proof-theoretic Analysis Of Nfmentioning

confidence: 99%

“…In particular, we shall be concerned with the transformational approach initiated in [5], also known as intensional negation [26,30,7].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Regular search spaces and constructive negation

Momigliano

Ornaghi

1997

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…Finally, a related work is [5], where a set of operations for composing logic programs are studied in the context of intensional negation. Negation is handled in a constructive way by transforming normal programs into pairs of definite programs and by defining the composition operations on such pairs.…”

Section: Discussionmentioning

confidence: 99%

On the Semantics of Logic Program Composition

Brogi

2004

Program Development in Computational Logic

View full text Add to dashboard Cite

Abstract. This paper aims at offering an insightful synthesis of different compositional semantics for logic program composition which have been developed in the literature. In particular, we will analyse the notions of program equivalence, compositionality, and full abstraction for logic programs. We will show how the notion of supported interpretation provides a unifying compositional model-theoretic characterisation both of positive programs and of programs containing negation.

show abstract

An Algorithm for Local Variable Elimination in Normal Logic Programs

Àlvez

Lucio

2006

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract.A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as negation, compilation, memoization, static analysis, program approximation by neural networks etc. As a consequence, the absence of local variables yields better performance of several tools and is a prerequisite for many technical results. In this paper, we introduce an algorithm that eliminates local variables from a wide proper subclass of normal logic programs. The proposed transformation preserves the Clark-Kunen semantics for normal logic programs.

show abstract

A transformational approach to negation in logic programming

Cited by 58 publications

References 12 publications

Regular search spaces and constructive negation

Regular search spaces and constructive negation

On the Semantics of Logic Program Composition

An Algorithm for Local Variable Elimination in Normal Logic Programs

Contact Info

Product

Resources

About