Graph Structures for Knowledge Representation and Reasoning

Versatile and effective techniques for knowledge representation and reasoning (KRR) are essential for the development of successful intelligent systems. Many representatives of next generation KRR systems are based on graph-based knowledge representation formalisms and leverage graph-theoretical notions and results. The goal of the workshop series on Graph Structures for Knowledge Representation and Reasoning (GKR) is to bring together the researchers involved in the development and application of graph-based knowledge representation formalisms and reasoning techniques. This volume contains revised selected papers of the third edition of GKR, which took place in Beijing, China on August 3, 2013. Like the previous editions, held in Pasadena, USA (2009), and in Barcelona, Spain (2011), the workshop was associated with IJCAI (the International Joint Conference on Artificial Intelligence), thus providing the perfect venue for a rich and valuable exchange. The scientific program of this workshop included many topics related to graph-based knowledge representation and reasoning such as representations of constraint satisfaction problems, formal concept analysis, conceptual graphs, argumentation frameworks and many more. All in all, the third edition of the GKR workshop was very successful. The papers coming from diverse fields all addressed various issues for knowledge representation and reasoning and the common graph-theoretic background allowed to bridge the gap between the different communities. This made it possible for the participants to gain new insights and inspiration. We are grateful for the support of IJCAI and we would also like to thank the Program Committee of the workshop for their hard work in reviewing papers and providing valuable guidance to the contributors. But, of course, GKR 2013 would not have been possible without the dedicated involvement of the contributing authors and participants.

[1]  Eugene C. Freuder,et al.  Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.

[2]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[3]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[4]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[5]  R. E. Pippert,et al.  Properties and characterizations of k -trees , 1971 .

[6]  Christian Bessiere,et al.  Efficient algorithms for singleton arc consistency , 2009, Constraints.

[7]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[8]  Christian Bessiere,et al.  Optimal and Suboptimal Singleton Arc Consistency Algorithms , 2005, IJCAI.

[9]  Philippe Jégou,et al.  Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[10]  Craig A. Knoblock,et al.  Reformulating CSPs for Scalability with Application to Geospatial Reasoning , 2007, CP.

[11]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[12]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[13]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[14]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[15]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[16]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[17]  Peter van Beek,et al.  Local and Global Relational Consistency , 1995, Theor. Comput. Sci..