Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
Software as a service (SaaS) is an emerging software framework in which business data and logic typically integrate with other applications. It requires a unified subscriber to des...
Liu Ying, Zhang Bin, Liu Guoqi, Wang Deshuai, Gao ...