3335 search results - page 50 / 667 » Grid result checking |
143
Voted
TIME
2009
IEEE
15 years 10 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
152
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
157
Voted
AGP
2003
IEEE
15 years 9 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
142
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: In biological and medical domain, the use of web services made the data and computation functionality accessible in a unified manner, which helped automate the data pi...
129
Voted
MIDDLEWARE
2004
Springer
15 years 9 months ago
2004
Springer
: The next generation of scientific experiments and studies, popularly called as e-Science, is carried out by large collaborations of researchers distributed around the world engag...