SCLPSenior Citizens Law Project
SCLPSouth Carolina Libertarian Party
SCLPSet Covering Location Problem (network algorithm)
SCLPStandardized Chapel Library Project (American Library Association; Chicago, IL)
SCLPSpouse/Common-Law Partner (Canada)
SCLPSuffolk County Libertarian Party (NY)
SCLPSignal Channel Link Protocol
References in periodicals archive ?
A 31 de diciembre de 2002, veintitres paises habian elaborado DELP completos y casi todos ellos estaban aplicando programas respaldados por el SCLP.
Si habia contribuido el proceso de los DELP y el SCLP a definir con mayor claridad la funcion del FMI en los paises de bajo ingreso.
Si los programas macroeconomicos en los que se basan los acuerdos respaldados por el SCLP son coherentes con las situaciones de los paises.
Si se habia modificado el enfoque de las negociaciones y el diseno de los acuerdos respaldados por el SCLP para adaptarlo a los objetivos del proceso de los DELP y el SCLP.
Si era eficaz la colaboracion entre el FMI y el Banco Mundial en la ejecucion del proceso de los DELP y el SCLP.
After describing the syntax of SCLP programs, we will define three equivalent semantics for such languages: model-theoretic, fix-point, and operational.
We also investigate the decidability of the semantics of SCLP programs, obtaining an interesting semidecidability result: if a goal has a semiring value greater than, or greater than or equal to, a certain value in the semiring, then we can discover this in finite time.
Section 2 recalls the main definitions and properties about semiring-based CSPs; then Section 3 defines the syntax of SCLP programs.
A shorter version of this paper, where the operational semantics was restricted to ground goals only, programs could not contain functions, and there was no decidability result (neither for SCLP programs nor for function-free SCLP programs), has appeared in Bistarelli et al.
For readers familiar with Constraint Logic Programming (CLP) programs, we can say that SCLP(S) programs (also written SCLP when the semiring is obvious or not important) are just CLP programs [Jaffar and Lassez 1987] where constraints are defined over a certain c-semiring S = <A, +, x, 0, 1>.
We now anticipate the behavior of this SCLP program, which obeys to the semantic development of the future sections.
While this example of an SCLP program uses semiring values to be able to find the best quasi-solutions in an otherwise overconstrained problem, other examples exploit the power of the chosen semiring to express features which are intrinsic to the considered problem.