4513 search results - page 292 / 903 » Logic programming with satisfiability |
124
click to vote
LATA
2010
Springer
16 years 1 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 ...
132
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...
152
click to vote
SPC
2005
Springer
15 years 9 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 ...
148
click to vote
SLOGICA
2008
15 years 4 months ago
2008
A generic format for adaptive vague logics is presented. The concrete adaptive vague logics based on this format are able to (1) identify sentences as vague or non-vague in the con...