Sciweavers

1179 search results - page 97 / 236
» Programming in Hybrid Constraint Languages
Sort
View
HYBRID
1997
Springer
15 years 5 months ago
Time-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
Simin Nadjm-Tehrani
PAAPP
2002
101views more  PAAPP 2002»
15 years 1 months ago
Static performance prediction of skeletal parallel programs
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Yasushi Hayashi, Murray Cole
CPAIOR
2009
Springer
15 years 8 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
TPLP
2010
102views more  TPLP 2010»
14 years 11 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
ICLP
2005
Springer
15 years 6 months ago
Abduction of Linear Arithmetic Constraints
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
Michael J. Maher