700 search results - page 136 / 140 » On Termination of Constraint Logic Programs |
DFT
2003
IEEE
14 years 21 days ago
2003
IEEE
Test scheduling and Test Access Mechanism (TAM) design are two important tasks in the development of a System-on-Chip (SOC) test solution. Previous test scheduling techniques assu...
DAC
2009
ACM
14 years 2 days ago
2009
ACM
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has a...
AGENTS
2001
Springer
13 years 12 months ago
2001
Springer
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
SIGSOFT
2000
ACM
13 years 11 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...