| 2012 | ||
|---|---|---|
| j14 | Liang Chang, Zhongzhi Shi, Tianlong Gu, Lingzhong Zhao: A Family of Dynamic Description Logics for Representing and Reasoning About Actions. J. Autom. Reasoning 49(1): 1-52 (2012) | |
| c20 | Yanwei Ma, Tianlong Gu, Binbin Xu, Liang Chang: An ABox Abduction Algorithm for the Description Logic ALCI. Intelligent Information Processing 2012: 125-130 | |
| c19 | Yu Meng, Tianlong Gu, Liang Chang: Reasoning about Assembly Sequences Based on Description Logic and Rule. Intelligent Information Processing 2012: 131-136 | |
| c18 | Liang Chang, Qicheng Zhang, Tianlong Gu, Zhongzhi Shi: Dynamic Logic for the Semantic Web. Intelligent Information Processing 2012: 137-146 | |
| c17 | Fengying Li, Tianlong Gu, Guoyong Cai, Liang Chang: Symbolic ZBDD Representations for Mechanical Assembly Sequences. Intelligent Information Processing 2012: 208-215 | |
| c16 | Qianjin Wei, Tianlong Gu, Fengying Li, Guoyong Cai: The Representation of Indiscernibility Relation Using ZBDDs. Intelligent Information Processing 2012: 216-225 | |
| c15 | Zhoubo Xu, Tianlong Gu, Rongsheng Dong: Symbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer. Intelligent Information Processing 2012: 226-233 | |
| 2011 | ||
| j13 | Tianlong Gu, Liang Chang, Zhoubo Xu: The Symbolic OBDD Algorithm for Finding Optimal Semi-matching in Bipartite Graphs. Communications and Network 3(2): 65-72 (2011) | |
| j12 | Tianlong Gu, Liang Chang, Zhoubo Xu: A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs. IJCNS 4(2): 111-121 (2011) | |
| j11 | ||
| j10 | ||
| j9 | ||
| j8 | Qianjin Wei, Tianlong Gu: Symbolic Representation for Rough Set Attribute Reduction Using Ordered Binary Decision Diagrams. JSW 6(6): 977-984 (2011) | |
| 2010 | ||
| j7 | Yaodong Cui, Tianlong Gu, Wei Hu: A bi-objective guillotine cutting problem of stamping strips of equal circles. Int. J. Comput. Math. 87(12): 2716-2721 (2010) | |
| c14 | Liang Chang, Zhongzhi Shi, Tianlong Gu: Extend Atomic Action Definitions of DDL to Support Occlusions and Conditional Post-conditions. Intelligent Information Processing 2010: 45-54 | |
| c13 | Lingzhong Zhao, Xuesong Wang, Junyan Qian, Tianlong Gu: Using ASP to Improve the Information Reuse in Mechanical Assembly Sequence Planning. PRICAI 2010: 384-396 | |
| 2009 | ||
| c12 | Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu: Automatic Construction of Complete Abstraction by Abstract Interpretation. ACIS-ICIS 2009: 927-932 | |
| c11 | Tie-yuan Liu, Liang Chang, Tianlong Gu: Analyzing the Impact of Entity Mobility Models on the Performance of Routing Protocols in the MANET. WGEC 2009: 56-59 | |
| c10 | Xuesong Wang, Lingzhong Zhao, Congwen Zeng, Junyan Qian, Tianlong Gu: An ASP Based Solution to Mechanical Assembly Sequence Planning. WGEC 2009: 205-208 | |
| 2008 | ||
| j6 | Tianlong Gu, Zhoubo Xu, Zhifei Yang: Symbolic OBDD representations for mechanical assembly sequences. Computer-Aided Design 40(4): 411-421 (2008) | |
| j5 | Tianlong Gu, Huadong Liu: The symbolic OBDD scheme for generating mechanical assembly sequences. Formal Methods in System Design 33(1-3): 29-44 (2008) | |
| j4 | Yaodong Cui, Tianlong Gu, Wei Hu: Simplest optimal guillotine cutting patterns for strips of identical circles. J. Comb. Optim. 15(4): 357-367 (2008) | |
| j3 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: Test frame updating in CPM testing of Prolog programs. Software Quality Journal 16(2): 277-298 (2008) | |
| c9 | Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu: Formula-Dependent Abstraction for CTL Model Checking. ICCSA (2) 2008: 1035-1048 | |
| 2007 | ||
| j2 | Tianlong Gu, Zhoubo Xu: The symbolic algorithms for maximum flow in networks. Computers & OR 34(3): 799-816 (2007) | |
| c8 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics. APLAS 2007: 105-121 | |
| c7 | Lingzhong Zhao, Tianlong Gu, Junyan Qian: Goal-independent Semantics for Path Dependent Analysis of Prolog Programs. TASE 2007: 261-272 | |
| 2006 | ||
| c6 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: On the New Application of Call Patterns to CPM Testing of Prolog Programs. Australian Conference on Artificial Intelligence 2006: 1265-1270 | |
| c5 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: Designing Prolog Semantics for a Class of Observables. PRICAI 2006: 1052-1057 | |
| c4 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: A Constraint-based Correct Call Pattern Semantics for Prolog as an Abstraction of Decorated Tree Semantics. SEKE 2006: 359-362 | |
| c3 | Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai: A Base for Achieving Semantics for Prolog with Cut for Correct Observables. Software Engineering Research and Practice 2006: 664-670 | |
| 2005 | ||
| j1 | Mahsa Ghaeli, Parisa A. Bahri, Peter L. Lee, Tianlong Gu: Petri-net based formulation and algorithm for short-term scheduling of batch plants. Computers & Chemical Engineering 29(2): 249-259 (2005) | |
| c2 | Weizhi Liao, Tianlong Gu: Optimization and Control of Production Systems Based on Interval Speed Continuous Petri Nets. SMC 2005: 1212-1217 | |
| 2003 | ||
| c1 | Tianlong Gu, Rongsheng Dong, Yu-Chu Tian: Continuous Petri nets augmented with maximal and minimal firing speeds. SMC 2003: 1493-1498 | |
Colors in the list of coauthors
Last update Sun May 26 01:25:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page