Sciweavers

1679 search results - page 112 / 336
» Strong order equivalence
Sort
View
FORTE
1997
13 years 11 months ago
A Hierarchy of Communication Models for Message Sequence Charts
In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating processes is depicted. An MSC defines a partial order on the communication events between the...
André Engels, Sjouke Mauw, Michel A. Renier...
AAAI
1990
13 years 11 months ago
Very Fast Decision Table Execution of Propositional Expert Systems
A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...
Robert M. Colomb, Charles Y. C. Chung
JCT
2008
103views more  JCT 2008»
13 years 10 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
JAPLL
2006
114views more  JAPLL 2006»
13 years 10 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
LPAR
2010
Springer
13 years 8 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...