Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

CLP(R)

Known as: CLP, Constraint logic programming (Real) 
CLP(R) is a declarative programming language. It stands for Constraint logic programming (Real) where real refers to the real numbers. It can be… Expand
Wikipedia

Related topics

Related topics

5 relations

Broader (3)

Constraint logic programmingConstraint programmingLogic programming
Generational list of programming languagesProlog

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Adapting CLP ( R ) To Floating-Point ArithmeticJ
As a logic programming language, Prolog has shortcomings. One of the most serious of these is in arithmetic. CLP(R), though a… Expand
Is this relevant?
2007
2007
CLP(F) and Constrained ODEs
CLP(F)andConstrainedODEsTimothy J. Hickey?(tim@cs.brandeis.edu)Michtom Scho ol of Computer ScienceVolen Center for Complex… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Fuzzy Prolog: a new approach using soft constraints propagation
We present a definition of a Fuzzy Prolog Language that models B([0,1])-valued Fuzzy Logic, and subsumes former approaches… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Parametric Sequence Alignment with Constraints
  • R. Yap
  • Constraints
  • 2004
    • Corpus ID: 12582989
Approximate matching techniques based on string alignment are important tools for investigating similarities between strings… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The ASM Refinement Method
  • E. Börger
  • Formal Aspects of Computing
  • 2003
    • Corpus ID: 18860092
In this paper the abstract state machine (ASM) refinement method is presented. Its characteristics compared to other refinement… Expand
  • figure 1
  • figure 2
Is this relevant?
1998
1998
Early Projection in CLP(R)
During the evaluation of a constraint logic program, many local variables become inaccessible, or dead. In Prolog and other… Expand
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Declarative Debugging Scheme
  • L. Naish
  • J. Funct. Log. Program.
  • 1997
    • Corpus ID: 7389173
We present a very simple but flexible declarative debugging scheme. A Abstract-1 declarative debugger can be defined in Prolog… Expand
  • figure 1
  • figure 4
  • figure 7
  • figure 10
Is this relevant?
1993
1993
Deeniteness Analysis for Clp(r)
  • N. Baker, Harald Ssndergaard
  • 1993
    • Corpus ID: 16859800
Constraint logic programming (CLP) languages generalise logic programming languages, amalgamating logic programming and… Expand
Is this relevant?
1993
1993
Interval constraint satisfaction tool INC++
Numerical design and planning problems can often be formulated conveniently as a set of equations constraining the values of… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1992
1992
An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs
Implementation technology for higher-order logic programming languages such as λProlog [17] and Elf [21] is still in its infancy… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE