Twelve Oxford papers at AAAI-15

Twelve Oxford papers have been accepted to the 29th AAAI Conference on Artificial Intelligence (AAAI-15). AAAI is one of the premier international conferences for artificial intelligence research; in 2015 it accepted a total of 531 papers out of 1991 submissions.  The conference will be held January 25-29, 2015, in Austin, Texas (USA), see http://www.aaai.org/Conferences/AAAI/aaai15.php for more information. The twelve papers are included below.
 

• Oskar Skibski, Tomasz Michalak, Sakurai, Makoto Yokoo, and Michael Wooldridge,
  A Graphical Representation for Games in Partition Function Form
   
• Aris Filos-Ratsikas, Minming Li, Jie Zhang, and Qiang Zhang,
  Facility location with double-peaked preferences
   
• David Cohen, Martin Cooper, Peter Jeavons, and Stanislav Zivny,
  Binarisation via Dualisation for Valued Constraints
   
• Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris, and Gerardo Simari,
  From Classical to Consistent Query Answering under Existential Rules
   
• Boris Motik, Yavor Nenov, Robert Piro, and Ian Horrocks,
  Handling owl:sameAs via Rewriting
   
• Ana Armas Romero, Mark Kaminski, Bernardo Cuenca Grau, and Ian Horrocks,
  Ontology Module Extraction via Datalog Reasoning
   
• Boris Motik, Yavor Nenov, Robert Piro and Ian Horrocks,
  Incremental Update of Datalog Materialisation: the Backward/Forward Algorithm
   
• Egor V. Kostylev, Juan L. Reutter, and Domagoj Vrgoc,
  XPath for DL Ontologies
   
• Giorgio Stefanoni and Boris Motik,
  Answering Conjunctive Queries over EL Knowledge Bases with Transitive  and Reflexive Roles
  
  
• Piotr L. Szczepański, Mateusz K. Tarkowski, Tomasz P. Michalak, Paul  Harrenstein, and Michael Wooldridge,
  Efficient Computation of Semivalues for Game-Theoretic Network Centrality
   
• Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert  Freeman, and Toby Walsh,
  Justified Representation in Approval-Based Committee Voting
   
• Edith Elkind, Piotr Faliszewski, Martin Lackner, and Svetlana Obraztsova,
  The Complexity of Recognizing Incomplete Single-Crossing Preferences.