Logic programming systems featuring Constraint Logic Programming (Jaffar and Ma-her 1994) and tabled execution (Tamaki and Sato 1986; Warren 1992) have been shown to increase the declarativeness and efficiency of Prolog, while at the same time making it possible to write very expressive programs. Previous implementations fully integrating both capabilities (i.e., forcing suspension, answer subs...

Online learning algorithms often have the issue of exhibiting poor performance during initial stages optimization procedure, which in practical applications might dissuade potential users from deploying such solutions. In this paper, we study a novel setting, namely conservative online convex optimization, are optimizing sequence loss functions under constraint that to perform at least as well ...

XSB is a highly declarative programming system consisting of Prolog extended with tabled resolution. It is useful for many tasks, some of which require constraint solving. Thus flexible and high level support for constraint systems is required. Constraint Handling Rules is exactly such a high level language embedded in Prolog for writing application tailored constraint solvers. In this paper we...

WORK EXACTLY AS REJECTED AT THE MAIN ECAI 2004 Abstract. We define a quantitative constraint language subsuming two calculi well-known in QSR: Frank’s cone-shaped and projection-based calculi of cardinal direction relations. The language is based on convex constraints of the form (α, β)(x, y), with α, β ∈ [0, 2π) and (β−α) ∈ [0, π): the meaning of such a constraint is that point x belongs to th...

We present new approaches for solving constrained multicomponent nonlinear Schr\"odinger equations in arbitrary dimensions. The idea is to introduce an artificial time and solve extended damped second order dynamic system whose stationary solution the time-independent equation. Constraints are often considered by projection onto constraint set, here we include them explicitly into dynamical sys...

the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative languages. We sketch the main aspects of Meta-S including solver and language integration as well as its strategy definition framework for specifying solver cooperation and language evaluation strategies by means of an example. ...

The central perspective model is generally used in photogrammetry because of the high reliability, but it has a weak point that the initial values of orientation parameters are necessary due to the non-linearity. On the other hand, the model based on projective geometry, which is widely used in computer vision, can be treated as linear forms, but many indefinitenesses in the model leads to the ...