3671 search results - page 262 / 735 » On Garbage and Program Logic |
165
click to vote
LPNMR
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
176
click to vote
IJCAI
2001
15 years 8 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
184
click to vote
SPC
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
188
click to vote
LOGCOM
2010
15 years 1 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
175
click to vote
COORDINATION
2009
Springer
16 years 7 months ago
2009
Springer
This paper presents a transactional framework for low-latency, high-performance, concurrent event processing in Java. At the heart of our framework lies Reflexes, a restricted prog...