default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th IJCAI 2017: Melbourne, Australia
- Carles Sierra:
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017. ijcai.org 2017, ISBN 978-0-9992411-0-3
Invited Speakers
- Luigi Bellomarini, Georg Gottlob, Andreas Pieris, Emanuel Sallinger:
Swift Logic for Big Data and Knowledge Graphs. 2-10 - Rong Jin:
Deep Learning at Alibaba. 11-16 - Ugo Pagallo
:
From Automation to Autonomous Systems: A Legal Phenomenology with Problems of Accountability. 17-23 - Tuomas Sandholm:
Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em. 24-25
Main track
Agent-based and Multi-agent Systems
- Pritee Agrawal, Pradeep Varakantham:
Proactive and Reactive Coordination of Non-dedicated Agent Teams Operating in Uncertain Environments. 28-34 - Faez Ahmed, John P. Dickerson, Mark D. Fuge:
Diverse Weighted Bipartite b-Matching. 35-41 - Martin Aleksandrov, Toby Walsh:
Pure Nash Equilibria in Online Fair Division. 42-48 - Gianvincenzo Alfano, Sergio Greco, Francesco Parisi:
Efficient Computation of Extensions for Dynamic Abstract Argumentation Frameworks: An Incremental Approach. 49-55 - Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, Srdjan Vesic:
Acceptability Semantics for Weighted Argumentation Frameworks. 56-62 - Leila Amgoud, Jonathan Ben-Naim, Srdjan Vesic:
Measuring the Intensity of Attacks in Argumentation Graphs with Shapley Value. 63-69 - Guy Avni, Shibashis Guha, Orna Kupferman:
An Abstraction-Refinement Methodology for Reasoning about Network Games. 70-76 - Haris Aziz, Ronald de Haan, Baharak Rastegari:
Pareto Optimal Allocation under Uncertain Preferences. 77-83 - Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. 84-90 - Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic. 91-97 - Francesco Belardinelli, Panagiotis Kouvaros, Alessio Lomuscio:
Parameterised Verification of Data-aware Multi-Agent Systems. 98-104 - Nahla Ben Amor, Hélène Fargier, Régis Sabbadin:
Equilibria in Ordinal Games: A Framework based on Possibility Theory. 105-111 - Aniket Bera, Tanmay Randhavane, Dinesh Manocha:
Aggressive, Tense or Shy? Identifying Personality Traits from Crowd Videos. 112-118 - Vitor Bosshard, Benedikt Bünz, Benjamin Lubin, Sven Seuken:
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Continuous Value and Action Spaces. 119-127 - Sylvain Bouveret, Yann Chevaleyre, François Durand, Jérôme Lang:
Voting by sequential elimination with few voters. 128-134 - Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. 135-141 - Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris:
Bounding the Inefficiency of Compromise. 142-148 - Ioannis Caragiannis, Evi Micha:
Learning a Ground Truth Ranking Using Noisy Approval Votes. 149-155 - Tathagata Chakraborti, Sarath Sreedharan, Yu Zhang, Subbarao Kambhampati:
Plan Explanations as Model Reconciliation: Moving Beyond Explanation as Soliloquy. 156-163 - Mithun Chakraborty, Kai Yee Phoebe Chua, Sanmay Das, Brendan Juba:
Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits. 164-170 - Stefano Coniglio, Nicola Gatti, Alberto Marchesi:
Pessimistic Leader-Follower Equilibria with Multiple Followers. 171-177 - Stephen Cranefield, Michael Winikoff, Virginia Dignum, Frank Dignum:
No Pizza for You: Value-based Plan Selection in BDI Agents. 178-184 - Jérôme Euzenat:
Interaction-based ontology alignment repair with expansion and relaxation. 185-191 - Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. 192-198 - Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. 199-205 - Nikos Gorogiannis, Franco Raimondi, Ioana Boureanu:
A Novel Symbolic Approach to Verifying Epistemic Properties of Programs. 206-212 - Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski:
Object Allocation via Swaps along a Social Network. 213-219 - Dylan Hadfield-Menell, Anca D. Dragan, Pieter Abbeel, Stuart Russell:
The Off-Switch Game. 220-227 - Zehong Hu, Jie Zhang:
Optimal Posted-Price Mechanism in Microtask Crowdsourcing. 228-234 - Guangda Huzhang, Xin Huang, Shengyu Zhang, Xiaohui Bei:
Online Roommate Allocation Problem. 235-241 - Yasushi Kawase, Atsushi Iwasaki:
Near-Feasible Stable Matchings with Budget Constraints. 242-248 - Hiroyuki Kido, Keishi Okamoto:
A Bayesian Approach to Argument-Based Reasoning for Attack Estimation. 249-255 - Thomas C. King, Akin Günay, Amit K. Chopra, Munindar P. Singh:
Tosca: Operationalizing Commitments Over Information Protocols. 256-264 - Vincent J. Koeman, Koen V. Hindriks, Catholijn M. Jonker:
Omniscient Debugging for Cognitive Agent Programs. 265-272 - Aaron Koolyk, Tyrone Strangway, Omer Lev, Jeffrey S. Rosenschein:
Convergence and Quality of Iterative Voting Under Non-Scoring Rules. 273-279 - Frédéric Koriche, Sylvain Lagrue, Éric Piette, Sébastien Tabary:
Constraint-Based Symmetry Detection in General Game Playing. 280-287 - Panagiotis Kouvaros, Alessio Lomuscio:
Verifying Fault-tolerance in Parameterised Multi-Agent Systems. 288-294 - Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. 295-301 - Priel Levy, David Sarne, Igor Rochlin:
Contest Design with Uncertain Performance and Costly Participation. 302-309 - Lizi Liao, Xiangnan He, Zhaochun Ren, Liqiang Nie, Huan Xu, Tat-Seng Chua:
Representativeness-aware Aspect Analysis for Brand Monitoring in Social Media. 310-316 - Yang Liu, Mingyan Liu:
Crowd Learning: Improving Online Decision Making Using Crowdsourced Data. 317-323 - Krzysztof Magiera, Piotr Faliszewski:
Recognizing Top-Monotonic Preference Profiles in Polynomial Time. 324-330 - Michail Mamakos, Georgios Chalkiadakis:
Probability Bounds for Overlapping Coalition Formation. 331-337 - Pasin Manurangsi, Warut Suksompong:
Computing an Approximately Optimal Agreeable Set of Items. 338-344 - Nicholas Mattei, Abdallah Saffidine, Toby Walsh:
Mechanisms for Online Organ Matching. 345-351 - Vijay Menon, Kate Larson:
Deterministic, Strategyproof, and Fair Cake Cutting. 352-358 - Kazunori Ohta, Nathanaël Barrot, Anisse Ismaili, Yuko Sakurai, Makoto Yokoo:
Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals. 359-365 - Andrew Perrault, Craig Boutilier:
Multiple-Profile Prediction-of-Use Games. 366-373 - Sébastien Picault, Yu-Lin Huang, Vianney Sicard, Pauline Ezanno:
Enhancing Sustainability of Complex Epidemiological Models through a Generic Multilevel Agent-based Approach. 374-380 - Aaron Schlenker, Haifeng Xu, Mina Guirguis, Christopher Kiekintveld, Arunesh Sinha, Milind Tambe, Solomon Y. Sonya, Darryl Balderas, Noah Dunstatter:
Don't Bury your Head in Warnings: A Game-Theoretic Approach for Intelligent Allocation of Cyber-security Alerts. 381-387 - Shreyas Sekar:
Posted Pricing sans Discrimination. 388-394 - Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia:
Why You Should Charge Your Friends for Borrowing Your Stuff. 395-401 - Sunil Simon, Dominik Wojtczak:
Synchronisation Games on Hypergraphs. 402-408 - Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. 409-415 - Jadwiga Sosnowska, Oskar Skibski:
Attachment Centrality for Weighted Graphs. 416-422 - Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga:
Online Optimization of Video-Ad Allocation. 423-429 - Noga Talmor, Noa Agmon:
On the Power and Limitations of Deception in Multi-Robot Adversarial Patrolling. 430-436 - Rohit Vaish, Dinesh Garg:
Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous. 437-443 - Feng Wu, Shlomo Zilberstein, Xiaoping Chen:
Multi-Agent Planning with Baseline Regret Minimization. 444-450 - Mingyu Xiao, Yuqing Wang:
Score Aggregation via Spectral Method. 451-457 - Nitin Yadav, John Thangarajah, Sebastian Sardiña:
Agent Design Consistency Checking via Planning. 458-464 - Yair Zick, Kobi Gal, Yoram Bachrach, Moshe Mash:
How to Form Winning Coalitions in Mixed Human-Computer Settings. 465-471
Combinatorial & Heuristic Search
- Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser:
Estimating the size of search trees by sampling with domain knowledge. 473-479 - Pascal Bercher, Gregor Behnke, Daniel Höller, Susanne Biundo:
An Admissible HTN Planning Heuristic. 480-488 - Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. 489-495 - Michael Cui, Daniel Damir Harabor, Alban Grastien:
Compromise-free Pathfinding on a Navigation Mesh. 496-502 - Yong Gao:
A Random Model for Argumentation Framework: Phase Transitions, Empirical Hardness, and Heuristics. 503-509 - Carlos Hernández, Adi Botea, Jorge A. Baier, Vadim Bulitko:
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads. 510-516 - Jinkun Lin, Shaowei Cai, Chuan Luo, Kaile Su:
A Reduction based Method for Coloring Very Large Graphs. 517-523 - Topi Talvitie, Teppo Mikael Niinimäki, Mikko Koivisto:
The Mixing of Markov Chains on Linear Extensions in Practice. 524-530
Constraints and Satisfiability
- Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. 532-538 - Behrouz Babaki, Tias Guns, Luc De Raedt:
Stochastic Constraint Programming with And-Or Branch-and-Bound. 539-545 - Sam Bayless, Nodir Kodirov, Ivan Beschastnikh, Holger H. Hoos, Alan J. Hu:
Scalable Constraint-based Virtual Data Center Allocation. 546-554 - Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. 555-562 - Miquel Bofill, Joan Espasa, Mateu Villaret:
Relaxed Exists-Step Plans in Planning as SMT. 563-570 - Shaowei Cai, Chuan Luo, Haochen Zhang:
From Decimation to Local Search and Back: A New Approach to MaxSAT. 571-577 - Clément Carbonnel, Emmanuel Hebrard:
On the Kernelization of Global Constraints. 578-584 - Michael Codish, Michael Frank, Vitaly Lagoon:
The DNA Word Design Problem: A New Constraint Model and New Results. 585-591 - Sumanth Dathathri, Nikos Aréchiga, Sicun Gao, Richard M. Murray:
Learning-Based Abstractions for Nonlinear Constraint Solving. 592-599 - Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas. 600-606 - Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. 607-613 - Christoph Erkinger, Nysret Musliu:
Personnel Scheduling as Satisfiability Modulo Theories. 614-621 - Yi Fan, Nan Li, Chengqian Li, Zongjie Ma, Longin Jan Latecki, Kaile Su:
Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation. 622-630 - Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Finding Robust Solutions to Stable Marriage. 631-637 - Jesús Giráldez-Cru, Jordi Levy:
Locality in Random SAT Instances. 638-644 - Antti Hyttinen, Paul Saikko, Matti Järvisalo:
A Core-Guided Approach to Learning Optimal Causal Graphs. 645-651 - Alexey Ignatiev, António Morgado, João Marques-Silva:
Cardinality Encodings for Graph Optimization Problems. 652-658 - Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao:
Learning to Run Heuristics in Tree Search. 659-666 - Jean-Marie Lagniez, Pierre Marquis:
An Improved Decision-DNNF Compiler. 667-673 - Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. 674-680 - Baudouin Le Charlier, Minh Thanh Khong, Christophe Lecoutre, Yves Deville:
Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints. 681-687 - Nian-Ze Lee, Yen-Shi Wang, Jie-Hong R. Jiang:
Solving Stochastic Boolean Satisfiability under Random-Exist Quantification. 688-694 - Qi Liu, Guifeng Wang, Hongke Zhao, Chuanren Liu, Tong Xu, Enhong Chen:
Enhancing Campaign Design in Crowdfunding: A Product Supply Optimization Perspective. 695-702 - Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü:
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. 703-711 - Ciaran McCreesh, Patrick Prosser, James Trimble:
A Partitioning Algorithm for Maximum Common Subgraph Problems. 712-719 - Paolo Morettin, Andrea Passerini, Roberto Sebastiani:
Efficient Weighted Model Integration via SMT-Based Predicate Abstraction. 720-728 - Anthony Palmieri, Arnaud Lallouet:
Constraint Games revisited. 729-735 - Anastasia Paparrizou, Kostas Stergiou:
On Neighborhood Singleton Consistencies. 736-742 - Jussi Rintanen:
Temporal Planning with Clock-Based SMT Encodings. 743-749 - Buser Say, Ga Wu, Yu Qing Zhou, Scott Sanner:
Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming. 750-756 - Sam Snodgrass, Santiago Ontañón:
Player Movement Models for Video Game Level Generation. 757-763
Knowledge Representation, Reasoning, and Logic
- Krzysztof R. Apt, Eryk Kopczynski, Dominik Wojtczak:
On the Computational Complexity of Gossip Protocols. 765-771 - Theofanis I. Aravanis, Pavlos Peppas, Mary-Anne Williams:
Epistemic-entrenchment Characterization of Parikh's Axiom. 772-778 - Haris Aziz, Serge Gaspers, Kamran Najeebullah:
Weakening Covert Networks by Minimizing Inverse Geodesic Length. 779-785 - Franz Baader, Stefan Borgwardt, Marcel Lippmann:
Query Rewriting for DL-Lite with n-ary Concrete Domains. 786-792 - Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Michaël Thomazo:
Answering Conjunctive Regular Path Queries over Guarded Existential Rules. 793-799 - Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
A General Notion of Equivalence for Abstract Argumentation. 800-806 - Ringo Baumann, Christof Spanring:
A Study of Unrestricted Abstract Argumentation Frameworks. 807-813 - Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
A Model for Accountable Ordinal Sorting. 814-820 - Francesco Belardinelli, Andreas Herzig:
Dynamic Logic for Data-aware Systems: Decidability Results. 821-827 - Vaishak Belle, Gerhard Lakemeyer:
Reasoning about Probabilities in Unbounded First-Order Dynamical Domains. 828-836 - Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura:
Reformulating Queries: Theory and Practice. 837-843 - Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana:
Ontology-Mediated Query Answering for Key-Value Stores. 844-851 - Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran:
The Impact of Treewidth on ASP Grounding and Solving. 852-858 - Bart Bogaerts, Joost Vennekens, Marc Denecker:
Safe Inductions: An Algebraic Study. 859-865 - Bart Bogaerts, Luís Cruz-Filipe:
Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory. 866-872 - Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin:
Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints. 873-879 - Pierre Bourhis, Michael Morak, Andreas Pieris:
Making Cross Products and Guarded Ontology Languages Compatible. 880-886 - Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. 887-893 - Robert Bredereck, Edith Elkind:
Manipulating Opinion Diffusion in Social Networks. 894-900