Results 1  10
of
63
Answers Synthesis for CLP with Negation
 In Proceedings of ECAI'96
, 1996
"... . Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. Logic programs are represented as rewrite programs whose operational mechanism, inspired from KnuthBendix completion, allows to prune some unnecessary computations and offers ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
a synthesis ability which enables to represent infinite sets of answers as finite sets of formulas. We extend this approach to CLP with negation. Our mechanism, integrating both non symbolic constraints and negation, keeps the loop avoiding and synthesis properties. Taking advantage of a
Open Architecture for CLP
, 1995
"... The usual way to implement an efficient CLP system is to define a set of primitive constraints which can be accessed from Prolog and to code them very efficiently, e.g. in C. This approach produces programs that are very fast, however in the long run it is not productive: the user's ability to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The usual way to implement an efficient CLP system is to define a set of primitive constraints which can be accessed from Prolog and to code them very efficiently, e.g. in C. This approach produces programs that are very fast, however in the long run it is not productive: the user's ability
CLP(R) and Some Electrical Engineering Problems
 Journal of Automated Reasoning
, 1991
"... The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constrain ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(R). A detailed look at some of the more important programming techniques highlights the ability of CLP(R) to support wellknown, powerful techniques from
Towards Native Code Generation in CLP
, 1995
"... Native code generation and global analysis gave substantial speedups in the case of Prolog. In order to generate native code in CLP we must first generate native code for the various constraint solving algorithms. The paper presents a simple scheme for the native code compilation of the incremen ..."
Abstract
 Add to MetaCart
on the efficiency of the generated code. 1 Introduction Constraint Logic Programming [15, 26, 16] provides an elegant and powerful framework for the cooperation of various constraint solving algorithms. In the future, a major requirement from a CLP system will be the ability to easily incorporate a new constraint
Answer Synthesis for CLP Programs with Negation
 Journal of the Interest Group in Pure and Applied Logic
, 1997
"... Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. By transforming clauses into logical equivalences considered as rewrite rules, logic programs are represented as rewrite programs whose operational mechanism, inspired from the K ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
the KnuthBendix completion, allows one to prune some unnecessary computations and offers a synthesis ability which enables to represent infinite sets of answers as finite sets of formulas. We propose here a full extension of this approach to Constraint Logic Programming (CLP ) with negation. Issued from
A CLP proof method for timed automata
 In 25th RTSS
, 2004
"... Constraint Logic Programming (CLP) has been used to model programs and transition systems for the purpose of verification problems. In particular, it has been used to model Timed Safety Automata (TSA). In this paper, we start with a systematic translation of TSA into CLP. The main contribution is an ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Constraint Logic Programming (CLP) has been used to model programs and transition systems for the purpose of verification problems. In particular, it has been used to model Timed Safety Automata (TSA). In this paper, we start with a systematic translation of TSA into CLP. The main contribution
A Powerful Evaluation Strategy For CLP Programs
 Proc. Intl. Workshop on Principles and Practice of Constraint Programming
, 1993
"... This paper presents a new, powerful evaluation strategy (OLDTCAM) for CLP programs. OLDTCAM is developed by combining the OLDT evaluation strategy with a logical answer manipulation mechanism. Under the OLDTCAM evaluation strategy, the termination characteristics of CLP programs are greatly improv ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
improved and the expressive abilities of CLP languages are greatly increased. One application of this power is the direct solving of optimization problems. Through an example, we show how an optimization problem can be expressed as a CLP program simply and be solved logically in the constraint logic
From Constraint Minimization to Goal Optimization in CLP languages
 In: Principles and Practice of Constraint Programming
, 1995
"... In this paper we discuss how the ability of the constraint solvers to deal with constraint minimization can be lifted up to various forms of goal optimization within CLP languages. We emphasis the link there is between optimization and negation both in the declarative semantics and in the operat ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we discuss how the ability of the constraint solvers to deal with constraint minimization can be lifted up to various forms of goal optimization within CLP languages. We emphasis the link there is between optimization and negation both in the declarative semantics
Defeasibility in CLP(Q) through Generalized Slack Variables
, 1996
"... . This paper presents a defeasible constraint solver for the domain of linear equations, disequations and inequalities over the body of rational/real numbers. As extra requirements resulting from the incorporation of the solver into an Incremental Hierarchical Constraint Solver (IHCS) scenario we id ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
identified: a)the ability to refer to individual constraints by a label, b) the ability to report the (minimal) cause for the unsatisfiability of a set of constraints, and c) the ability to undo the effects of a formerly activated constraint. We develop the new functionalities after starting the presentation
A Generic Type System for CLP(X)
 Ecole Normale Superieure LIENS
, 1997
"... We propose a generic static type system for Constraint Logic Programming including subtyping and parametric polymorphism. The first aim of this prescriptive type system is to detect type errors statically in CLP programs. The system introduces a type discipline on the way CLP programs and libraries ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We propose a generic static type system for Constraint Logic Programming including subtyping and parametric polymorphism. The first aim of this prescriptive type system is to detect type errors statically in CLP programs. The system introduces a type discipline on the way CLP programs and libraries
Results 1  10
of
63