IJCAI 2017

781 papers

A Characterization Theorem for a Modal Description Logic

Paul Wild, Lutz Schröder

Inferring Human Attention by Learning Latent Intentions

Ping Wei, Dan Xie, Nanning Zheng, Song-chun Zhu

Explicit Knowledge-based Reasoning for Visual Question Answering

Peng Wang, Qi Wu, Chunhua Shen, Anthony Dick, Anton van den Hengel

How a General-Purpose Commonsense Ontology can Improve Performance of Learning-Based Image Retrieval

Rodrigo Toro Icarte, Jorge A. Baier, Cristian Ruz, Alvaro Soto

GDL-III: A Description Language for Epistemic General Game Playing

Michael Thielscher

On Computing World Views of Epistemic Logic Programs

Tran Cao Son, Tiep Le, Patrick Kahl, Anthony Leclerc

Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction

Michael Sioutis, Jean-François Condotta

Fair Allocation based on Diminishing Differences

Erel Segal-Halevi, Haris Aziz, Avinatan Hassidim

A Reasoning System for a First-Order Logic of Limited Belief

Christoph Schwering

Conflict-driven ASP Solving with External Sources and Program Splits

Christoph Redl

Efficient and Complete FD-solving for extended array constraints

Quentin Plazar, Mathieu Acher, Sébastien Bardin, Arnaud Gotlieb

The Bag Semantics of Ontology-Based Data Access

Charalampos Nikolaou, Egor V. Kostylev, George Konstantinidis, Mark Kaminski, Bernardo Cuenca Grau

Generalized Target Assignment and Path Finding Using Answer Set Programming

Van Nguyen, Philipp Obermeier, Tran Cao Son, Torsten Schaub, William Yeoh

Dominance and Optimisation Based on Scale-Invariant Maximum Margin Preference Learning

Mojtaba Montazery, Nic Wilson

Contract Design for Energy Demand Response

Reshef Meir, Hongyao Ma, Valentin Robu

Context-aware Path Ranking for Knowledge Base Completion

Sahisnu Mazumder, Bing Liu

Logic on MARS: Ontologies for Generalised Property Graphs

Maximilian Marx, Markus Krötzsch, Veronika Thost

Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability

Carsten Lutz, Leif Sabellek

A Data-Driven Approach to Infer Knowledge Base Representation for Natural Language Relations

Kangqi Luo, Xusheng Luo, Xianyang Chen, Kenny Q. Zhu

Temporalising Separation Logic for Planning with Search Control Knowledge

Xu Lu, Cong Tian, Zhenhua Duan

Mapping Repair in Ontology-based Data Access Evolving Systems

Domenico Lembo, Riccardo Rosati, Valerio Santarelli, Domenico Fabio Savo, Evgenij Thorstensen

Induction of Interpretable Possibilistic Logic Theories from Relational Data

Ondrej Kuzelka, Jesse Davis, Steven Schockaert

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks

Markus Kröll, Reinhard Pichler, Stefan Woltran

Model Checking Multi-Agent Systems against LDLK Specifications

Jeremy Kong, Alessio Lomuscio

Strong Syntax Splitting for Iterated Belief Revision

Gabriele Kern-Isberner, Gerhard Brewka

Foundations of Declarative Data Analysis Using Limit Datalog Programs

Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev, Boris Motik, Ian Horrocks

Query Conservative Extensions in Horn Description Logics with Inverse Roles

Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider

Belief Manipulation Through Propositional Announcements

Aaron Hunter, François Schwarzentruber, Eric Tsang

ATL Strategic Reasoning Meets Correlated Equilibrium

Xiaowei Huang, Ji Ruan

A General Multi-agent Epistemic Planner Based on Higher-order Belief Change

Xiao Huang, Biqing Fang, Hai Wan, Yongmei Liu

Revisiting Unrestricted Rebut and Preferences in Structured Argumentation.

Jesse Heyninck, Christian Straßer

Characterising the Manipulability of Boolean Games

Paul Harrenstein, Paolo Turrini, Michael Wooldridge

Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage

Víctor Gutiérrez-Basulto, Jean Christoph Jung

Nash Equilibria in Concurrent Games with Lexicographic Preferences

Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Michael Wooldridge

Relatedness-based Multi-Entity Summarization

Kalpa Gunaratna, Amir Hossein Yazdavar, Krishnaprasad Thirunarayan, Amit Sheth, Gong Cheng

Non-Determinism and the Dynamics of Knowledge

Davide Grossi, Andreas Herzig, Wiebe van der Hoek, Christos Moyzes

The Tractability of the Shapley Value over Bounded Treewidth Matching Games

Gianluigi Greco, Francesco Lupia, Francesco Scarcello

What Can You Do with a Rock? Affordance Extraction via Word Embeddings

Nancy Fulda, Daniel Ricks, Ben Murdoch, David Wingate

Strategically knowing how

Raul Fervari, Andreas Herzig, Yanjun Li, Yanjing Wang

Process Plan Controllers for Non-Deterministic Manufacturing Systems

Paolo Felli, Lavindra de Silva, Brian Logan, Svetan Ratchev

Lazy-Grounding for Answer Set Programs with External Source Access

Thomas Eiter, Tobias Kaminski, Antonius Weinzierl

Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints

Dario Della Monica, Nicola Gigante, Angelo Montanari, Pietro Sala, Guido Sciavicco

Streaming Multi-Context Systems

Minh Dao-Tran, Thomas Eiter

On Querying Incomplete Information in Databases under Bag Semantics

Marco Console, Paolo Guagliardo, Leonid Libkin

Temporal Sequences of Qualitative Information: Reasoning about the Topology of Constant-Size Moving Regions

Quentin Cohen-Solal, Maroua Bouzid, Alexandre Niveau

Inferring Implicit Event Locations from Context with Distributional Similarities

Jin-Woo Chung, Wonsuk Yang, Jinseon You, Jong C. Park

Handling non-local dead-ends in Agent Planning Programs

Lukáš Chrpa, Nir Lipovetzky, Sebastian Sardina

Discriminative Dictionary Learning With Ranking Metric Embedded for Person Re-Identification

De Cheng, Xiaojun Chang, Li Liu, Alexander G. Hauptmann, Yihong Gong

Learning from Ontology Streams with Semantic Concept Drift

Jiaoyan Chen, Freddy Lecue, Jeff Z. Pan, Huajun Chen

Most Probable Explanations for Probabilistic Database Queries

İsmail İlkan Ceylan, Stefan Borgwardt, Thomas Lukasiewicz

Query Answering in Ontologies under Preference Rankings

İsmail İlkan Ceylan, Thomas Lukasiewicz, Rafael Peñaloza, Oana Tifrea-Marciuska

An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games

Jiri Cermák, Branislav Bosansky, Viliam Lisy

Belief Change in a Preferential Non-monotonic Framework

Giovanni Casini, Thomas Meyer

Restricted Chase (Non)Termination for Existential Rules with Disjunctions

David Carral, Irina Dragoste, Markus Krötzsch

Budget-Constrained Dynamics in Multiagent Systems

Rui Cao, Pavel Naumov

Classical Generalized Probabilistic Satisfiability

Carlos Caleiro, Filipe Casal, Andreia Mordido

Strong Inconsistency in Nonmonotonic Reasoning

Gerhard Brewka, Matthias Thimm, Markus Ulbricht

Manipulating Opinion Diffusion in Social Networks

Robert Bredereck, Edith Elkind

On Coalitional Manipulation for Multiwinner Elections: Shortlisting

Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier

Making Cross Products and Guarded Ontology Languages Compatible

Pierre Bourhis, Michael Morak, Andreas Pieris

Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints

Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin

Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory

Bart Bogaerts, Luís Cruz-Filipe

Safe Inductions: An Algebraic Study

Bart Bogaerts, Joost Vennekens, Marc Denecker

The Impact of Treewidth on ASP Grounding and Solving

Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran

Ontology-Mediated Query Answering for Key-Value Stores

Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana

Reformulating Queries: Theory and Practice

Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura

Reasoning about Probabilities in Unbounded First-Order Dynamical Domains

Vaishak Belle, Gerhard Lakemeyer

Dynamic Logic for Data-aware Systems: Decidability Results

Francesco Belardinelli, Andreas Herzig

A Model for Accountable Ordinal Sorting

Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane

A Study of Unrestricted Abstract Argumentation Frameworks

Ringo Baumann, Christof Spanring

A General Notion of Equivalence for Abstract Argumentation

Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran

Answering Conjunctive Regular Path Queries over Guarded Existential Rules

Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Michaël Thomazo

Query Rewriting for DL-Lite with n-ary Concrete Domains

Franz Baader, Stefan Borgwardt, Marcel Lippmann

Weakening Covert Networks by Minimizing Inverse Geodesic Length

Haris Aziz, Serge Gaspers, Kamran Najeebullah

Epistemic-entrenchment Characterization of Parikh’s Axiom

Theofanis Aravanis, Pavlos Peppas, Mary-Anne Williams

On the Computational Complexity of Gossip Protocols

Krzysztof R. Apt, Eryk Kopczyński, Dominik Wojtczak

Player Movement Models for Video Game Level Generation

Sam Snodgrass, Santiago Ontanon

Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming

Buser Say, Ga Wu, Yu Qing Zhou, Scott Sanner

Temporal Planning with Clock-Based SMT Encodings

Jussi Rintanen

On Neighborhood Singleton Consistencies

Anastasia Paparrizou, Kostas Stergiou

Constraint Games revisited

Anthony Palmieri, Arnaud Lallouet

Efficient Weighted Model Integration via SMT-Based Predicate Abstraction

Paolo Morettin, Andrea Passerini, Roberto Sebastiani

A Partitioning Algorithm for Maximum Common Subgraph Problems

Ciaran McCreesh, Patrick Prosser, James Trimble

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers

Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü

Enhancing Campaign Design in Crowdfunding: A Product Supply Optimization Perspective

Qi Liu, Guifeng Wang, Hongke Zhao, Chuanren Liu, Tong Xu

Solving Stochastic Boolean Satisfiability under Random-Exist Quantification

Nian-Ze Lee, Yen-Shi Wang, Jie-Hong R. Jiang

Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints

Baudouin Le Charlier, Minh Thanh Khong, Christophe Lecoutre, Yves Deville

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem

Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail

An Improved Decision-DNNF Compiler

Jean-Marie Lagniez, Pierre Marquis

Learning to Run Heuristics in Tree Search

Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao

Cardinality Encodings for Graph Optimization Problems

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva

A Core-Guided Approach to Learning Optimal Causal Graphs

Antti Hyttinen, Paul Saikko, Matti Järvisalo

Locality in Random SAT Instances

Jesús Giráldez-Cru, Jordi Levy

Finding Robust Solutions to Stable Marriage

Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin

Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation

Yi Fan, Nan Li, Chengqian Li, Zongjie Ma, Longin Jan Latecki

Personnel Scheduling as Satisfiability Modulo Theories

Christoph Erkinger, Nysret Musliu

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints

Pavel Dvořák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas

Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi

Learning-Based Abstractions for Nonlinear Constraint Solving

Sumanth Dathathri, Nikos Arechiga, Sicun Gao, Richard M. Murray

The DNA Word Design Problem: A New Constraint Model and New Results

Michael Codish, Michael Frank, Vitaly Lagoon