3738 search results - page 260 / 748 » Parametrized Logic Programming |
133
click to vote
LPNMR
2005
Springer
15 years 10 months 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, ...
138
click to vote
IJCAI
2001
15 years 5 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...
154
click to vote
SPC
2005
Springer
15 years 10 months 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 ...
152
click to vote
LOGCOM
2010
14 years 11 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...
137
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...