CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information.In this paper, we propose a new trace for CHR which contains enough information to ...

In this report, we show how to use the Simple Fluent Calculus (SFC) to specify generic tracers, i.e. tracers which produce a generic trace. A generic trace is a trace which can be produced by different implementations of a software component and used independently from the traced component. This approach is used to define a method for extending a java based CHR platform called CHROME (Constrain...

Developing and maintaining CLP programs requires visualization and explanation tools. However, existing tools are built in an ad hoc way. Therefore porting tools from one platform to another is very difficult. We have shown in previous work that, from a fine-grained execution trace, a number of interesting views about logic program executions could be generated by trace analysis. In this articl...

This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devoted to the design of algorithms that support an incremental style of building solutions allowing both constraint posting and constraint retraction. In particular, the AC-3 algorithm for constraint propagation, customized...

The Conjunct Constraint has been shown to result from independently motivated constraints in several theories of grammar, for example, Ross (1967) notes that it results independently from his A-over-A Principle, and Pollard and Sag (1994) from their Trace Principle. We address facts concerning the Element Constraint, which bars the movement of elements contained within a conjunct as opposed to ...

We consider the problem of learning a high-dimensional but low-rank matrix from a large-scale dataset distributed over several machines, where low-rankness is enforced by a convex trace norm constraint. We propose DFW-Trace, a distributed Frank-Wolfe algorithm which leverages the low-rank structure of its updates to achieve efficiency in time, memory and communication usage. The step at the hea...

Received September 16, 1992; accepted October 9, 1992; revised manuscript received December 1, 1992 We recently introduced a new technique, frequency-resolved optical gating (FROG), for directly determining the full intensity I(t) and phase p(t) of a single femtosecond pulse. By using almost any instantaneous nonlinearoptical interaction of two replicas of the ultrashort pulse to be measured, F...

Programs with constraints are hard to debug. In this paper, we describe a general architecture to help develop new debugging tools for constraint programming. The possible tools are fed by a single general-purpose tracer. A tracer-driver is used to adapt the actual content of the trace, according to the needs of the tool. This enables the tools and the tracer to communicate in a clientserver sc...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

We describe a novel approach to curve inference based on curvature information. The inference procedure is divided into two stages: a trace inference stage, to which this paper is devoted, and a curve synthesis stage, which will be treated in a separate paper. It is shown that recovery of the trace of a curve requires estimating local models for the curve at the same time, and that tangent and ...