4192 search results - page 295 / 839 » Probabilistic Logic Programming |
177
click to vote
AAAI
2007
15 years 9 months ago
2007
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
162
click to vote
LATA
2010
Springer
16 years 4 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
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 2 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 ...