778 search results - page 32 / 156 » Expressiveness and complexity of graph logic |
129
click to vote
BMCBI
2007
15 years 18 days ago
2007
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
164
click to vote
BMCBI
2010
15 years 18 days ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
106
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
123
Voted
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
113
Voted
ADBIS
2006
Springer
15 years 6 months ago
2006
Springer
XML is suitable for structuring complex data coming from different sources and supported by heterogeneous formats. It allows a flexible formalism capable to represent and store d...