Sciweavers

2084 search results - page 252 / 417
» Set Constraints in Logic Programming
Sort
View
CP
2005
Springer
14 years 1 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
DSD
2009
IEEE
126views Hardware» more  DSD 2009»
14 years 6 days ago
Architecture-Driven Synthesis of Reconfigurable Cells
In this paper, we present a novel method for merging sets of computational patterns into a reconfigurable cell respecting design constraints and optimizing specific design aspects...
Christophe Wolinski, Krzysztof Kuchcinski, Erwan R...
POPL
2001
ACM
14 years 8 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
ATAL
2006
Springer
14 years 1 days ago
Run-time model checking of interaction and deontic models for multi-agent systems
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
Nardine Osman, David Robertson, Christopher Walton
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv