2273 search results - page 39 / 455 » On the Expressiveness and Complexity of ATL |
CP
2000
Springer
14 years 3 days ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
BMCBI
2005
13 years 8 months ago
2005
Background: The integration of genomic information with quantitative experimental data is a key component of systems biology. An increasing number of microbial genomes are being s...
INFOCOM
2011
IEEE
13 years 6 days ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
BMCBI
2005
13 years 8 months ago
2005
Background: Human heart failure is a complex disease that manifests from multiple genetic and environmental factors. Although ischemic and non-ischemic heart disease present clini...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...