Sciweavers

7167 search results - page 292 / 1434
» Answer Set Programming
Sort
View
DAGSTUHL
2006
15 years 4 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
LPNMR
2007
Springer
15 years 8 months ago
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
NMR
2004
Springer
15 years 8 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
133
Voted
PLDI
1999
ACM
15 years 7 months ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard
ECCC
2010
103views more  ECCC 2010»
15 years 2 months ago
Pseudorandom Generators for Regular Branching Programs
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff