77 search results - page 4 / 16 » On expressiveness of the chain graph interpretations |
167
click to vote
ICCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
178
click to vote
ATVA
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
164
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical proce...
176
click to vote
ISBRA
2007
Springer
16 years 15 days ago
2007
Springer
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
151
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...