Results 1 
2 of
2
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 35 (5 self)
 Add to MetaCart
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 constraints, the CLP(R) language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and nonnumeric computation. In this paper we illustrate the practical applicability of CLP(R) with examples of programs to solve electrical engineering problems. 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 constraint programming. Our thesis is that CLP(R) is an embodiment of these techniques in a langu...
SPREADSPACES: MathematicallyIntelligent Graphical Spreadsheets
"... Abstract. Starting from existing spreadsheet software, like Lotus 123 R ○ , Excel R ○ , or Spreadsheet 2000 R ○ , we propose a sequence of enhancements to fully integrate constraintbased reasoning, culminating in a system for reactive, graphical, mathematical constructions. This is driven by our ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Starting from existing spreadsheet software, like Lotus 123 R ○ , Excel R ○ , or Spreadsheet 2000 R ○ , we propose a sequence of enhancements to fully integrate constraintbased reasoning, culminating in a system for reactive, graphical, mathematical constructions. This is driven by our view of constraints as the essence of (spreadsheet) computation, rather than as an addon tool for expert users. We call this extended computational metaphor, spreadspaces. We believe that research towards more general and realistic constraint solving frameworks has to go on in parallel with the effort to make fewer and fewer requests to the user. In other words, users should be asked only for as much as they want to give the system. This amount of information (decided by users but with a minimum set by the system below which most precision is lost) is then used by the system to construct the whole constraint problem.