5482 search results - page 287 / 1097 » Logic Programming and Databases |
164
click to vote
LPNMR
2005
Springer
16 years 3 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, ...
172
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...
182
click to vote
SPC
2005
Springer
16 years 3 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 ...
174
click to vote
EUROSYS
2009
ACM
16 years 3 months ago
2009
ACM
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
186
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...