Sciweavers

2974 search results - page 264 / 595
» Model-Driven Constraint Programming
Sort
View
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 10 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ā...
Johannes Klaus Fichte, Stefan Szeider
PC
2012
223views Management» more  PC 2012»
14 years 2 months ago
Using shared arrays in message-driven parallel programs
This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how ...
Phil Miller, Aaron Becker, Laxmikant V. Kalé...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
14 years 2 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
DAC
2007
ACM
16 years 7 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
ICLP
2009
Springer
16 years 7 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski