Sciweavers

1032 search results - page 45 / 207
» Extended Computation Tree Logic
Sort
View
LOPSTR
2009
Springer
15 years 4 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
CVPR
2008
IEEE
15 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
BIRTHDAY
1992
Springer
15 years 1 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson
CLIMA
2007
14 years 11 months ago
EVOLP: Tranformation-Based Semantics
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
Martin Slota, João Leite