Sciweavers

2084 search results - page 155 / 417
» Set Constraints in Logic Programming
Sort
View
AGP
1998
IEEE
13 years 12 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
DAC
1996
ACM
14 years 13 days ago
Tutorial: Design of a Logic Synthesis System
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
Richard L. Rudell
NGC
1998
Springer
171views Communications» more  NGC 1998»
13 years 8 months ago
Programming Languages for Distributed Applications
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
Seif Haridi, Peter Van Roy, Per Brand, Christian S...
ASP
2005
Springer
14 years 1 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
CSCLP
2007
Springer
14 years 2 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan