Model-Based Diagnosis with Constraint Logic Programs

1991 ◽  
pp. 168-180 ◽  
Author(s):  
Igor Mozetič ◽  
Christian Holzbaur
Keyword(s):  
Logic Programs ◽  
Model Based ◽  
Constraint Logic Programs

scholarly journals Program Verification using Constraint Handling Rules and Array Constraint Generalizations

10.29007/dkxs ◽  
2018 ◽  
Author(s):  
Emanuele De Angelis ◽  
Fabio Fioravanti ◽  
Alberto Pettorossi ◽  
Maurizio Proietti
Keyword(s):  
Data Structures ◽  
Program Verification ◽  
Linear Constraints ◽  
Constraint Handling ◽  
Logic Programs ◽  
Replacement Strategy ◽  
Partial Correctness ◽  
Transformation Rules ◽  
Constraint Logic Programs ◽  
Additional Constraints

The transformation of constraint logic programs (CLP programs)has been shown to be an effective methodologyfor verifying properties of imperative programs.By following this methodology, we encode the negationof a partial correctness property of an imperativeprogram prog as a predicate incorrect defined by a CLP program P, and we show thatprog is correct by transforming P intothe empty program through the applicationof semantics preserving transformation rules.Some of these rules perform replacements of constraintsthat encode properties of the data structures manipulatedby the program prog.In this paper we show that Constraint Handling Rules (CHR)are a suitable formalism for representing and applyingconstraint replacements during the transformation of CLP programs.In particular, we consider programs that manipulate integerarrays and we present a CHR encoding of a constraint replacementstrategy based on the theory of arrays.We also propose a novel generalization strategy forconstraints on integer arrays that combinesthe CHR constraint replacement strategywith various generalization operator for linear constraints,such as widening and convex hull.Generalization is controlled by additional constraintsthat relate the variable identifiers in the imperativeprogram and the CLP representation of their values.The method presented in this paper has been implemented andwe have demonstrated itseffectiveness on a set ofbenchmark programs taken from the literature.

scholarly journals Induction of constraint logic programs

1998 ◽  
pp. 148-167 ◽  
Author(s):  
Michèle Sebag ◽  
Céline Rouveirol ◽  
Jean-François Puget
Keyword(s):  
Logic Programs ◽  
Constraint Logic Programs

scholarly journals A backward analysis for constraint logic programs

2002 ◽  
Vol 2 (4-5) ◽  
pp. 517-547 ◽  
Author(s):  
ANDY KING ◽  
LUNJIN LU
Keyword(s):  
Ad Hoc ◽  
Abstract Interpretation ◽  
Logic Program ◽  
Control Flow ◽  
Third Party ◽  
Logic Programs ◽  
Abstract Domains ◽  
Constraint Logic Programs ◽  
Backward Analysis ◽  
Computational Properties

One recurring problem in program development is that of understanding how to re-use code developed by a third party. In the context of (constraint) logic programming, part of this problem reduces to figuring out how to query a program. If the logic program does not come with any documentation, then the programmer is forced to either experiment with queries in an ad hoc fashion or trace the control-flow of the program (backward) to infer the modes in which a predicate must be called so as to avoid an instantiation error. This paper presents an abstract interpretation scheme that automates the latter technique. The analysis presented in this paper can infer moding properties which if satisfied by the initial query, come with the guarantee that the program and query can never generate any moding or instantiation errors. Other applications of the analysis are discussed. The paper explains how abstract domains with certain computational properties (they condense) can be used to trace control-flow backward (right-to-left) to infer useful properties of initial queries. A correctness argument is presented and an implementation is reported.

scholarly journals Unfolding and fixpoint semantics of concurrent constraint logic programs

1992 ◽  
Vol 105 (1) ◽  
pp. 85-128 ◽  
Author(s):  
Maurizio Gabbrielli ◽  
Giorgio Levi
Keyword(s):  
Logic Programs ◽  
Fixpoint Semantics ◽  
Constraint Logic Programs

scholarly journals Rules and Strategies for Contextual Specialization of Constraint Logic Programs

2000 ◽  
Vol 30 (2) ◽  
pp. 129-144 ◽  
Author(s):  
Fabio Fioravanti ◽  
Alberto Pettorossi ◽  
Maurizio Proietti
Keyword(s):  
Logic Programs ◽  
Constraint Logic Programs

Constrained relative least general generalization for Inducing Constraint Logic Programs

1995 ◽  
Vol 13 (3-4) ◽  
pp. 335-368 ◽  
Author(s):  
Fumio Mizoguchi ◽  
Hayato Ohwada
Keyword(s):  
Logic Programs ◽  
Constraint Logic Programs

Recurrence with affine level mappings is P-time decidable for CLP

2007 ◽  
Vol 8 (01) ◽  
pp. 111-119 ◽  
Author(s):  
FRED MESNARD ◽  
ALEXANDER SEREBRENIK
Keyword(s):  
Polynomial Time ◽  
Logic Programs ◽  
Constraint Logic Programs

AbstractIn this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document