Sciweavers

4218 search results - page 271 / 844
» Complete sets of cooperations
Sort
View
98
Voted
ENTCS
2006
124views more  ENTCS 2006»
15 years 25 days ago
Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps...
Igor B. Bourdonov, Alexander Kossatchev, Victor V....
74
Voted
JAIR
2008
92views more  JAIR 2008»
15 years 25 days ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
NETWORKS
2008
15 years 23 days ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
66
Voted
MLQ
2006
78views more  MLQ 2006»
15 years 23 days ago
Recursive logic frames
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...
Saharon Shelah, Jouko A. Väänänen
80
Voted
JCT
2007
85views more  JCT 2007»
15 years 22 days ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...