Negation and quantifiers in NU-Prolog

Naish, Lee

doi:10.1007/3-540-16492-8_111

Cited by 54 publications

(38 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This difficulty can be mitigated by providing a more intelligent scheduling strategy, so that filters are applied as soon as a data structure has been partially generated, hence determining early failure and backtracking when a data structure shape does not satisfy the constraints defined by the filters. A lot of research in the area of logic programming has been devoted to devise techniques for allowing the user to specify sophisticated selection strategies, such as delay (or wait) declarations, which determine a dynamic scheduling of the atoms to be evaluated based on their instantiation patterns [31]. However, the increased intricacies of the implementation of the dynamic scheduling mechanism may reduce the efficiency gains due to more intelligent scheduling.…”

Section: Transformational Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Efficient generation of test data structures using constraint logic programming and program transformation

Fioravanti

Proietti

Senni

2013

Journal of Logic and Computation

View full text Add to dashboard Cite

Abstract. The goal of Bounded-Exhaustive Testing (BET) is the automatic generation of all test cases satisfying a given invariant, within a given size bound. When the test cases have a complex structure, the development of correct and efficient generators becomes a very challenging task. In this paper we use Constraint Logic Programming (CLP) to systematically develop generators of structurally complex test data structures. We follow a declarative approach which allows us to separate the issue of (i) defining the test data structure in terms of its properties, from that of (ii) efficiently generating data structure instances. This separation helps establish the correctness of the developed test case generators. We rely on a symbolic representation and we take advantage of efficient search strategies provided by CLP systems for generating test instances. Through a running example taken from the literature on BET, we illustrate our test generation framework and we show that CLP allows us to develop easily understandable and efficient test generators. Additionally, we propose a program transformation technique whose goal is to make the evaluation of these CLP-based generators much more efficient and we demonstrate its effectiveness on a number of complex test data structures.

show abstract

Section: Transformational Optimizationmentioning

confidence: 99%

“…A possible solution is to adopt a more efficient, problem specific, scheduling strategy, as it happens in dynamic scheduling via delay declarations [31], at the cost of a strong overhead on the evaluation mechanism.…”

Section: Introductionmentioning

confidence: 99%

Efficient generation of test data structures using constraint logic programming and program transformation

Fioravanti

Proietti

Senni

2013

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…This is particularly true for definite programs and open negative queries where no soundness problem can arise. Moreover, if we ensure that no instantiation link arises on eigenvariables, then we may safely select open negated goals, as is well known [36,45], under the name of ESLDNF-resolution.…”

Section: Ax\ : P: ->Q(x) Ax2: Q(a)mentioning

confidence: 99%

“…This is obviously only a partial solution, since at run-time there is no guarantee to eventually ground the problematic query. A further improvement is offered by the computation rules of IC-Prolog (see [36], for a comprehensive analysis and references). …”

Section: Constructive Negationmentioning

confidence: 99%

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

“…These meta-clauses are not only useful to describe the selection strategy, they also allow one to define efficient control for resolution. Some work on the automatic definition of meta-clauses, in simpler cases, is reported in [25].…”

Section: Third Defining Axiom Of Sortedmentioning

confidence: 99%

Software testing based on formal specifications: a theory and a tool

1991

View full text Add to dashboard Cite

This paper addresses the problem of constructing test data sets from formal specifications. Starting from a notion of an ideal exhaustive test data set which is derived from the notion of satisfaction of the formal specification, it is shown how to select by refinements a practicable test set, i.e. computable, not rejecting correct programs (unbiased), and accepting only correct programs (valid), assuming some hypotheses. The hypotheses play an important role: they formalize common test practices and they express the gap between the success of the test and correctness ; the size of the test set depends on the strength of the hypotheses.The paper shows an application of this theory in the case of algebraic specifications and presents the actual procedures used to mechanically produce such test sets, using Horn clause logic. These procedures are embedded in an interactive system which, given some general hypotheses schemes and an algebraic specification, produces a test set and the corresponding hypotheses.

show abstract

Negation and quantifiers in NU-Prolog

Cited by 54 publications

References 1 publication

Efficient generation of test data structures using constraint logic programming and program transformation

Efficient generation of test data structures using constraint logic programming and program transformation

Regular search spaces and constructive negation

Software testing based on formal specifications: a theory and a tool

Contact Info

Product

Resources

About