2017 List of Eligible Prominent AIJ Papers (2010-2017)
Artificial Intelligence
Volume 174, Number 1, January 2010
Javier Farreres, Karina Gibert, Horacio Rodríguez, Charnyote Pluempitiwiriyawej:
Inference of lexical ontologies. The LeOnI methodology. 1-19
Paul E. Dunne, Sarit Kraus, Efrat Manisterski, Michael Wooldridge:
Solving coalitional resource games. 20-50
Timothy J. Norman, Chris Reed:
A logic of delegation. 51-71
John Grant, Francesco Parisi, Austin Parker, V. S. Subrahmanian:
An AGM-style belief revision mechanism for probabilistic spatio-temporal logics. 72-104
Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded treewidth as a key to tractability of knowledge representation and reasoning. 105-132
Volume 174, Number 2, February 2010 (only Review Papers)
Volume 174, Numbers 3-4, March 2010
Blai Bonet:
Conformant plans and beyond: Principles and complexity. 245-269
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies. 270-294
Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski:
Logic programs with abstract constraint atoms: The role of computations. 295-315
Piergiorgio Bertoli, Marco Pistore, Paolo Traverso:
Automated composition of Web services via planning in asynchronous domains. 316-361
Volume 174, Numbers 5-6, April 2010
Mingyu Guo, Vincent Conitzer:
Optimal-in-expectation redistribution mechanisms. 363-381
Gianluigi Greco, Francesco Scarcello:
On the power of structural decompositions of graph-based representations of constraint problems. 382-409
Cesar García-Osorio, Aida de Haro-García, Nicolás García-Pedrajas:
Democratic instance selection: A linear complexity instance selection algorithm based on classifier ensemble concepts. 410-441
Binghui Liu, Jianhua Guo, Bing-Yi Jing:
A note on minimal d-separation trees for structural learning. 442-448
Volume 174, Numbers 7-8, May 2010
Martin C. Cooper, Simon de Givry, M. Sanchez, Thomas Schiex, Matthias Zytnicki, T. Werner:
Soft arc consistency revisited. 449-478
Thierry Denoeux, Zoulficar Younes, Fahed Abdallah:
Representing uncertainty on set-valued variables using belief functions. 479-499
Michele Lombardi, Michela Milano:
Allocation and scheduling of Conditional Task Graphs. 500-529
David Gianazza:
Forecasting workload and airspace configuration with neural networks and tree search methods. 530-549
Volume 174, Numbers 9-10, June 2010
Sung-Soon Choi, Jeong Han Kim:
Optimal query complexity bounds for finding graphs. 551-569
Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. 570-584
Peter Schachte, Harald Søndergaard, Leigh Whiting, Kevin Henshall:
Information loss in knowledge compilation: A comparison of Boolean envelopes. 585-596
Yuhua Qian, Jiye Liang, Witold Pedrycz, Chuangyin Dang:
Positive approximation: An accelerator for attribute reduction in rough set theory. 597-618
Mausam, Stephen Soderland, Oren Etzioni, Daniel S. Weld, Kobi Reiter, Michael Skinner, Marcus Sammer, Jeff Bilmes:
Panlingual lexical translation via probabilistic inference. 619-637
Volume 174, Number 11, July 2010
Loizos Michael:
Partial observability and learnability. 639-669
Paolo Ciancarini, Gian Piero Favini:
Monte Carlo tree search in Kriegspiel. 670-684
Frédéric Koriche, Bruno Zanuttini:
Learning conditional preference networks. 685-703
Mohan Sridharan, Jeremy L. Wyatt, Richard Dearden:
Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs. 704-725
Doug Downey, Oren Etzioni, Stephen Soderland:
Analysis of a probabilistic model of redundancy in unsupervised information extraction. 726-748
Pingzhong Tang, Yoav Shoham, Fangzhen Lin:
Designing competitions between teams of individuals. 749-766
Volume 174, Numbers 12-13, August 2010
Michael Katz, Carmel Domshlak:
Optimal admissible composition of abstraction heuristics. 767-798
Jérôme Lang, Pierre Marquis:
Reasoning under inconsistency: A forgetting-based approach. 799-823
Patricia Everaere, Sébastien Konieczny, Pierre Marquis:
Disjunctive merging: Quota and Gmin merging operators. 824-849
Christine Solnon:
AllDifferent-based filtering for subgraph isomorphism. 850-864
Ryan F. Kelly, Adrian R. Pearce:
Property persistence in the situation calculus. 865-888
Peter A. Thwaites, Jim Q. Smith, Eva Riccomagno:
Causal analysis with Chain Event Graphs. 889-909
Krzysztof Z. Gajos, Daniel S. Weld, Jacob O. Wobbrock:
Automatically generating personalized user interfaces with Supple. 910-950
Weiming Liu, Xiaotong Zhang, Sanjiang Li, Mingsheng Ying:
Reasoning about cardinal directions between extended objects. 951-983
Ole J. Mengshoel:
Understanding the scalability of Bayesian network inference using clique tree growth curves. 984-1006
Volume 174, Number 14, September 2010
Anthony Hunter, Sébastien Konieczny:
On the measure of conflicts: Shapley Inconsistency Values. 1007-1026
John A. Bateman, Joana Hois, Robert J. Ross, Thora Tenbrink:
A linguistic ontology of space for natural language processing. 1027-1071
Sandra Zilles, Robert C. Holte:
The computational complexity of avoiding spurious states in state space abstraction. 1072-1092
Volume 174, Number 15, October 2010
Roman Kontchakov, Frank Wolter, Michael Zakharyaschev:
Logic-based ontology comparison and module extraction, with an application to DL-Lite. 1093-1141
James Pita, Manish Jain, Milind Tambe, Fernando Ordóñez, Sarit Kraus:
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition. 1142-1171
Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko:
Updating action domain descriptions. 1172-1221
Joel Uckelman, Ulle Endriss:
Compactly representing utility functions using weighted goals and the max aggregator. 1222-1246
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luigi Palopoli:
Outlier detection for simple default theories. 1247-1253
Mario Graff, Riccardo Poli:
Practical performance models of algorithms in evolutionary program induction and other domains. 1254-1276
Jinbo Huang:
Extended clause learning. 1277-1284
Volume 174, Numbers 16-17, November 2010
Miroslaw Truszczynski:
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs. 1285-1306
Dongmo Zhang:
A logic-based axiomatic model of bargaining. 1307-1322
Dana S. Nau, Mitja Lustrek, Austin Parker, Ivan Bratko, Matjaz Gams:
When is it better not to look ahead? 1323-1338
Richard Booth, Samir Chopra, Thomas Andreas Meyer, Aditya Ghose:
Double preference relations for generalised belief change. 1339-1368
Ivan Serina:
Kernel functions for case-based planning. 1369-1406
Christopher Jefferson, Neil C. A. Moore, Peter Nightingale, Karen E. Petrie:
Implementing logical connectives in constraint programming. 1407-1429
Volume 174, Number 18, December 2010
Erik Sandewall:
Defeasible inheritance with doubt index and its axiomatic characterization. 1431-1459
Ya'akov Gal, Barbara J. Grosz, Sarit Kraus, Avi Pfeffer, Stuart M. Shieber:
Agent decision-making in open mixed networks. 1460-1480
Rui Abreu, Arjan J. C. van Gemund:
Diagnosing multiple intermittent failures using maximum likelihood estimation. 1481-1497
Diedrich Wolter, J. H. Lee:
Qualitative reasoning with directional relations. 1498-1507
José Hernández-Orallo, David L. Dowe:
Measuring universal intelligence: Towards an anytime intelligence test. 1508-1539
Hankz Hankui Zhuo, Qiang Yang, Derek Hao Hu, Lei Li:
Learning complex action models with quantifiers and logical implications. 1540-1569
Zhi-Hua Zhou, Jianxin Wu, Wei Tang:
Corrigendum to "Ensembling neural networks: Many could be better than all" [Artificial Intelligence 137 (1-2) (2002) 239-263]. 1570
Artificial Intelligence, Volume 175
Volume 175, Number 1, January 2011
Leora Morgenstern, Sheila A. McIlraith:
John McCarthy's legacy. 1-24
Alfredo Gabaldon:
Non-Markovian control in the Situation Calculus. 25-48
Antonis C. Kakas, Loizos Michael, Rob Miller:
Modular-έ and the role of elaboration tolerance in solving the qualification problem. 49-78
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ricardo Morales:
Approximation of action theories and its application to conformant planning. 79-119
Michael Thielscher:
A unifying action calculus. 120-141
Gerhard Lakemeyer, Hector J. Levesque:
A semantic characterization of a useful fragment of the situation calculus with knowledge. 142-164
Steven Shapiro, Maurice Pagnucco, Yves Lespérance, Hector J. Levesque:
Iterated belief change in the situation calculus. 165-192
Afsaneh Shirazi, Eyal Amir:
First-order logical filtering. 193-219
Joseph Y. Halpern, Riccardo Pucella:
Dealing with logical omniscience: Expressiveness and pragmatics. 220-235
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz:
Stable models and circumscription. 236-263
Fangzhen Lin, Yi Zhou:
From answer set logic programming to circumscription via logic of GK. 264-277
Wolfgang Faber, Gerald Pfeifer, Nicola Leone:
Semantics and complexity of recursive aggregates in answer set programming. 278-298
Ernest Davis:
How does a box work? A study in the qualitative dynamics of solid objects. 299-345
Pedro Cabalar, Paulo E. Santos:
Formalising the Fisherman's Folly puzzle. 346-377
Fiora Pirri:
The well-designed logical robot: Learning and experience from observations to the Situation Calculus. 378-415
Erik Sandewall:
From systems to logic in the early development of nonmonotonic reasoning. 416-427
Johan van Benthem:
McCarthy variations in a modal key. 428-439
Volume 175, Number 2, February 2011
Baharak Rastegari, Anne Condon, Kevin Leyton-Brown:
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions. 441-456
Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael Wooldridge:
Weighted argument systems: Basic definitions, algorithms, and complexity results. 457-486
Feng Wu, Shlomo Zilberstein, Xiaoping Chen:
Online planning for multi-agent systems with bounded communication. 487-511
Knot Pipatsrisawat, Adnan Darwiche:
On the power of clause-learning SAT solvers as resolution engines. 512-525
Stephanie Elzer, Sandra Carberry, Ingrid Zukerman:
The automated understanding of simple bar charts. 526-555
Alfonso Gerevini, Alessandro Saetti:
Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure. 556-585
Peter Nightingale:
The extended global cardinality constraint: An empirical survey. 586-614
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
A new representation and associated algorithms for generalized planning. 615-647
Athanasios Papakonstantinou, Alex Rogers, Enrico H. Gerding, Nicholas R. Jennings:
Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems. 648-672
Omer Qadir, Jerry Liu, Gianluca Tempesti, Jon Timmis, Andy M. Tyrrell:
From Bidirectional Associative Memory to a noise-tolerant, robust Protein Processor Associative Memory. 673-693
Vibhav Gogate, Rina Dechter:
SampleSearch: Importance sampling in presence of determinism. 694-729
Alex Rogers, Alessandro Farinelli, Ruben Stranders, Nicholas R. Jennings:
Bounded approximate decentralised coordination via the max-sum algorithm. 730-759
Florence Dupin de Saint-Cyr, Jérôme Lang:
Belief extrapolation (or how to reason about observations and unpredicted change). 760-790
Volume 175, Numbers 3-4, March 2011
Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
On the resolution-based family of abstract argumentation semantics and its grounded instance. 791-813
Emiliano Lorini, François Schwarzentruber:
A logic for reasoning about counterfactual emotions. 814-847
Daniel Bryce, William Cushing, Subbarao Kambhampati:
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning. 848-889
Yin Chen, Fangzhen Lin, Yan Zhang, Yi Zhou:
Loop-separable programs and their first-order definability. 890-913
Yun Fan, Jing Shen:
On the phase transitions of random k-constraint satisfaction problems. 914-927
Volume 175, Numbers 5-6, April 2011 (only Review Papers)
Volume 175, Numbers 7-8, May 2011
Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, Henri Prade:
Preferences in AI: An overview. 1037-1052
Nic Wilson:
Computational techniques for a simple theory of conditional preferences. 1053-1091
Denis Mindolin, Jan Chomicki:
Contracting preference relations for database applications. 1092-1121
Michael McGeachie, Jon Doyle:
The local geometry of multiattribute tradeoff preferences. 1122-1152
Christophe Gonzales, Patrice Perny, Jean-Philippe Dubus:
Decision making with multiple objectives using GAI networks. 1153-1179
Ronen I. Brafman:
Relational preference rules for control. 1180-1193
Meltem Öztürk, Marc Pirlot, Alexis Tsoukiàs:
Representing preferences using intervals. 1194-1222
Willem Waegeman, Bernard De Baets:
On the ERA ranking representability of pairwise bipartite ranking functions. 1223-1250
Vincent Conitzer, Tuomas Sandholm:
Expressive markets for donating to charities. 1251-1271
Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Incompleteness and incomparability in preference aggregation: Complexity results. 1272-1289
Fusun Yaman, Thomas J. Walsh, Michael L. Littman, Marie desJardins:
Democratic approximation of lexicographic preference models. 1290-1307
Meghyn Bienvenu, Christian Fritz, Sheila A. McIlraith:
Specifying and computing preferred plans. 1308-1345
Daniel Kikuti, Fabio Gagliardi Cozman, Ricardo Shirota Filho:
Sequential decision making with partially ordered preferences. 1346-1365
Gildas Jeantet, Olivier Spanjaard:
Computing rank dependent utility in graphical models for sequential decision problems. 1366-1389
Michael D. Moffitt:
On the modelling and optimization of preferences in constraint-based temporal reasoning. 1390-1409
Christophe Labreuche:
A general framework for explaining the results of a multi-attribute preference model. 1410-1448
Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten:
Preference-based English reverse auctions. 1449-1467
Ana Casali, Lluis Godo, Carles Sierra:
A graded BDI agent model to represent and reason about preferences. 1468-1478
Volume 175, Numbers 9-10, June 2011
Nikos Gorogiannis, Anthony Hunter:
Instantiating abstract argumentation with classical logic arguments: Postulates and properties. 1479-1497
Karina Valdivia Delgado, Scott Sanner, Leliane Nunes de Barros:
Efficient solutions to factored MDPs with imprecise transition probabilities. 1498-1527
Matthias Knorr, José Júlio Alferes, Pascal Hitzler:
Local closed world reasoning with description logics under the well-founded semantics. 1528-1554
Martin C. Cooper, Stanislav Zivny:
Hybrid tractability of valued constraint problems. 1555-1569
Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan R. Sturtevant, Zhifu Zhang:
Inconsistent heuristics in theory and practice. 1570-1603
Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Demsar:
Learning qualitative models from numerical data. 1604-1619
Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat:
On rules with existential variables: Walking the decidability line. 1620-1654
Ioannis Caragiannis, Ariel D. Procaccia:
Voting almost maximizes social welfare despite limited communication. 1655-1671
Shaowei Cai, Kaile Su, Abdul Sattar:
Local search with edge weighting and configuration checking heuristics for minimum vertex cover. 1672-1696
David Murray-Rust, Alan Smaill:
Towards a model of musical interaction and communication. 1697-1721
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and complexity results for persuasive argumentation. 1722-1736
Simone Paolo Ponzetto, Michael Strube:
Taxonomy induction based on a collaboratively built knowledge repository. 1737-1756
Volume 175, Number 11, July 2011
Francisco S. Melo, Manuela M. Veloso:
Decentralized MDPs with sparse interactions. 1757-1789
Bei Shui Liao, Li Jin, Robert C. Koons:
Dynamics of argumentation systems: A division-based method. 1790-1814
Steven Schockaert, Henri Prade:
Solving conflicts in information merging by a flexible interpretation of atomic propositions. 1815-1855
Sylvain Gelly, David Silver:
Monte-Carlo tree search and rapid action value estimation in computer Go. 1856-1875
Volume 175, Numbers 12-13, August 2011
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the complexity of core, kernel, and bargaining set. 1877-1910
Gert de Cooman, Enrique Miranda, Marco Zaffalon:
Independent natural extension. 1911-1950
Tias Guns, Siegfried Nijssen, Luc De Raedt:
Itemset mining: A constraint programming perspective. 1951-1983
Volume 175, Numbers 14-15, September 2011
Emilia Oikarinen, Stefan Woltran:
Characterizing strong equivalence for argumentation frameworks. 1985-2009
Pingzhong Tang, Fangzhen Lin:
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs. 2010-2020
Sebastian Stein, Enrico H. Gerding, Alex Rogers, Kate Larson, Nicholas R. Jennings:
Algorithms and mechanisms for procuring services with uncertain durations using redundancy. 2021-2060
Volume 175, Numbers 16-17, October - November 2011
Travis C. Service, Julie A. Adams:
Randomized coalition structure generation. 2061-2074
Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning heuristic functions for large state spaces. 2075-2098
Reinhard Moratz, Dominik Lücke, Till Mossakowski:
A condensed semantics for qualitative spatial reasoning about oriented straight line segments. 2099-2127
Volume 175, Number 18, December 2011
Husain Aljazzar, Stefan Leue:
K⁎: A heuristic search algorithm for finding the k shortest paths. 2129-2154
Weiming Liu, Sanjiang Li:
Reasoning about cardinal directions between extended objects: The NP-hardness result. 2155-2169
Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter:
Foundations of instance level updates in expressive description logics. 2170-2197
Saket Joshi, Kristian Kersting, Roni Khardon:
Decision-theoretic planning with generalized first-order decision diagrams. 2198-2222
Artificial Intelligence, Volume 176
Volume 176, Number 1, January 2012
James P. Delgrande, Yi Jin:
Parallel belief revision: Revising by sets of formulas. 2223-2245
Tao Chen, Nevin Lianwen Zhang, Tengfei Liu, Kin Man Poon, Yi Wang:
Model-based multidimensional clustering of categorical data. 2246-2269
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Andee Rubin, Barbara J. Grosz:
Plan recognition in exploratory domains. 2270-2290
Zhi-Hua Zhou, Min-Ling Zhang, Sheng-Jun Huang, Yu-Feng Li:
Multi-instance multi-label learning. 2291-2320
Artificial Intelligence, Volumes 177-179
Volumes 177-179, February - March 2012
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou:
Ordered completion for first-order logic programs on finite structures. 1-24
Omer Giménez, Anders Jonsson:
The influence of k-dependence on the complexity of planning. 25-45
Artificial Intelligence, Volumes 180-181
Volumes 180-181, April 2012
Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the quota in weighted voting games. 1-19
Yang Yu, Xin Yao, Zhi-Hua Zhou:
On the approximation ability of evolutionary optimization with application to minimum set cover. 20-33
Till Mossakowski, Reinhard Moratz:
Qualitative reasoning about relative direction of oriented points. 34-45
Artificial Intelligence, Volumes 182-183
Volumes 182-183, May 2012
Dominik Janzing, Joris M. Mooij, Kun Zhang, Jan Lemeire, Jakob Zscheischler, Povilas Daniusis, Bastian Steudel, Bernhard Schölkopf:
Information-geometric approach to inferring causal directions. 1-31
Byung Kon Kang, Kee-Eung Kim:
Exploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains. 32-57
Michele Lombardi, Michela Milano:
A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling. 58-67
Artificial Intelligence, Volumes 184-185
Volumes 184-185, June 2012
Geoffrey Chu, Peter J. Stuckey:
A complete solution to the Maximum Density Still Life Problem. 1-16
Vincent Wenchen Zheng, Yu Zheng, Xing Xie, Qiang Yang:
Towards mobile intelligence: Learning from GPS history data for collaborative recommendation. 17-37
Vibhav Gogate, Rina Dechter:
Importance sampling-based estimation over AND/OR search spaces for graphical models. 38-77
Nicola Basilico, Nicola Gatti, Francesco Amigoni:
Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder. 78-123
Artificial Intelligence, Volume 186
Volume 186, July 2012
Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran:
Towards fixed-parameter tractable algorithms for abstract argumentation. 1-37
Mark d'Inverno, Michael Luck, Pablo Noriega, Juan A. Rodríguez-Aguilar, Carles Sierra:
Communicating open systems. 38-94
Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge, Nicholas R. Jennings:
Anytime coalition structure generation in multi-agent systems with positive or negative externalities. 95-122
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein:
Algorithms for strategyproof classification. 123-156
Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider:
Augmenting tractable fragments of abstract argumentation. 157-173
Artificial Intelligence, Volume 187
Volumes 187-188, August 2012
Sebastian Haufe, Stephan Schiffel, Michael Thielscher:
Automated verification of state sequence invariants in general game playing. 1-30
Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein:
On the approximability of Dodgson and Young elections. 31-51
Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Conflict-driven answer set solving: From theory to practice. 52-89
Dominik Fisch, Martin Jänicke, Edgar Kalkowski, Bernhard Sick:
Learning from others: Exchange of classification rules in intelligent distributed systems. 90-114
Finale Doshi-Velez, Joelle Pineau, Nicholas Roy:
Reinforcement learning with limited reinforcement: Using Bayes risk for active learning in POMDPs. 115-132
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:
Local properties in modal logic. 133-155
Mario Alviano, Wolfgang Faber, Gianluigi Greco, Nicola Leone:
Magic Sets for disjunctive Datalog programs. 156-192
Artificial Intelligence, Volume 189
Volume 189, September 2012
Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael Wooldridge:
On the evaluation of election outcomes under uncertainty. 1-18
Andrey Kolobov, Mausam, Daniel S. Weld:
Discovering hidden structure in factored MDPs. 19-47
Carmel Domshlak, Michael Katz, Sagi Lefler:
Landmark-enhanced abstraction heuristics. 48-68
Brahim Hnich, Roberto Rossi, S. Armagan Tarim, Steven David Prestwich:
Filtering algorithms for global chance constraints. 69-94
Artificial Intelligence, Volume 190
Volume 190, October 2012
Tuan Anh Nguyen, Minh Binh Do, Alfonso Gerevini, Ivan Serina, Biplav Srivastava, Subbarao Kambhampati:
Generating diverse plans to handle unknown and partially known user preferences. 1-31
Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Optimizing with minimum satisfiability. 32-44
Artificial Intelligence, Volume 191
Volume 191-192, November 2012
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Applicability conditions for plans with loops: Computability results and algorithms. 1-19
Jonathan Lawry, Yongchuan Tang:
On truth-gaps, bipolar belief and the assertability of vague propositions. 20-41
Georg Gottlob:
On minimal constraint networks. 42-60
Veronica L. Policicchio, Adriana Pietramala, Pasquale Rullo:
GAMoN: Discovering M-of-N{¬, ∨} hypotheses for text classification by a lattice-based Genetic Algorithm. 61-95
Alan Bundy:
Robert Kowalski, , Computational Logic and Human Thinking: How to Be Artificially Intelligent (2011) . 96-97
Artificial Intelligence, Volume 193
Volume 193, December 2012
Yun Fan, Jing Shen, Ke Xu:
A general model and thresholds for random constraint satisfaction problems. 1-17
Ringo Baumann:
Normal and strong expansion equivalence for argumentation frameworks. 18-44
Jussi Rintanen:
Planning as satisfiability: Heuristics. 45-86
Andrea Calì, Georg Gottlob, Andreas Pieris:
Towards more expressive ontology languages: The query answering problem. 87-128
Santiago Ontañón, Pilar Dellunde, Lluis Godo, Enric Plaza:
A defeasible reasoning model of inductive concept learning from examples and communication. 129-148
W. T. Luke Teacy, Michael Luck, Alex Rogers, Nicholas R. Jennings:
An efficient and versatile approach to trust and reputation using hierarchical Bayesian modelling. 149-185
Arnon Netzer, Alon Grubshtein, Amnon Meisels:
Concurrent forward bounding for distributed constraint optimization problems. 186-216
Roberto Navigli, Simone Paolo Ponzetto:
BabelNet: The automatic construction, evaluation and application of a wide-coverage multilingual semantic network. 217-250
Artificial Intelligence, Volume 194
Volume 194, January 2013
Eduard H. Hovy, Roberto Navigli, Simone Paolo Ponzetto:
Editorial. 1
Introduction
Eduard H. Hovy, Roberto Navigli, Simone Paolo Ponzetto:
Collaboratively built semi-structured content and Artificial Intelligence: The story so far. 2-27
Acquiring knowledge
Johannes Hoffart, Fabian M. Suchanek, Klaus Berberich, Gerhard Weikum:
YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia. 28-61
Vivi Nastase, Michael Strube:
Transforming Wikipedia into a large scale multilingual concept network. 62-85
IR applications
Pekka Malo, Pyry-Antti Siitari, Ankur Sinha:
Automated query learning with Wikipedia and genetic programming. 86-110
Rianne Kaptein, Jaap Kamps:
Exploiting the category structure of Wikipedia for entity ranking. 111-129
NLP applications
Ben Hachey, Will Radford, Joel Nothman, Matthew Honnibal, James R. Curran:
Evaluating Entity Linking with Wikipedia. 130-150
Joel Nothman, Nicky Ringland, Will Radford, Tara Murphy, James R. Curran:
Learning multilingual named entity recognition from Wikipedia. 151-175
Majid Yazdani, Andrei Popescu-Belis:
Computing text semantic relatedness using the contents and links of a hypertext encyclopedia. 176-202
Sara Tonelli, Claudio Giuliano, Kateryna Tymoshenko:
Wikipedia-based WSD for multilingual frame annotation. 203-221
Tools
David N. Milne, Ian H. Witten:
An open-source toolkit for mining Wikipedia. 222-239
Neuroimaging
Francisco Pereira, Matthew Botvinick, Greg Detre:
Using Wikipedia to learn semantic feature representations of concrete concepts in neuroimaging experiments. 240-252
Volume 195, Pages 1-550 (February 2013)
A generalised framework for dispute derivations in assumption-based argumentation
Pages 1-43
Francesca Toni
Computational complexity of linear constraints over the integers
Pages 44-62
Peter Jonsson, Tomas Lööw
Near-optimal continuous patrolling with teams of mobile information gathering agents
Pages 63-105
R. Stranders, E. Munoz de Cote, A. Rogers, N.R. Jennings
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
Pages 106-139
Zinovi Rabinovich, Victor Naroditskiy, Enrico H. Gerding, Nicholas R. Jennings
Decomposition and tractability in qualitative spatial and temporal reasoning
Pages 140-164
Jinbo Huang, Jason Jingshi Li, Jochen Renz
A non-monotonic Description Logic for reasoning about typicality
Pages 165-202
L. Giordano, V. Gliozzi, N. Olivetti, G.L. Pozzato
How to progress a database III
Pages 203-221
Stavros Vassos, Hector J. Levesque
Evaluation of a simple, scalable, parallel best-first search strategy
Pages 222-248
Akihiro Kishimoto, Alex Fukunaga, Adi Botea
Detection of semantic errors in Arabic texts
Pages 249-264
Chiraz Ben Othmane Zribi, Mohamed Ben Ahmed
Approximation quality of the hypervolume indicator
Pages 265-290
Karl Bringmann, Tobias Friedrich
Causal identifiability via Chain Event Graphs
Pages 291-315
Peter Thwaites
Computing desirable partitions in additively separable hedonic games
Pages 316-334
Haris Aziz, Felix Brandt, Hans Georg Seedig
Data complexity of query answering in description logics
Pages 335-360
Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati
A general account of argumentation with preferences
Pages 361-397
Sanjay Modgil, Henry Prakken
Exploiting persistent mappings in cross-domain analogical learning of physical domains
Pages 398-417
Matthew Klenk, Ken Forbus
Incentive engineering for Boolean games
Pages 418-439
Michael Wooldridge, Ulle Endriss, Sarit Kraus, Jérôme Lang
Improving resource allocation strategies against human adversaries in security games: An extended study
Pages 440-469
Rong Yang, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe, Richard John
The increasing cost tree search for optimal multi-agent pathfinding
Pages 470-495
Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner
Bagging and Boosting statistical machine translation systems
Pages 496-527
Tong Xiao, Jingbo Zhu, Tongran Liu
Modeling information exchange opportunities for effective human–computer teamwork
Pages 528-550
Ece Kamar, Yaʼakov (Kobi) Gal, Barbara J. Grosz
Volume 196, Pages 1-142 (March 2013)
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions
Pages 1-25
Valeria Fionda, Gianluigi Greco
Physical search problems with probabilistic knowledge
Pages 26-52
Noam Hazon, Yonatan Aumann, Sarit Kraus, David Sarne
Predicting the size of IDA*ʼs search tree
Pages 53-76
Levi H.S. Lelis, Sandra Zilles, Robert C. Holte
SAT-based MaxSAT algorithms
Pages 77-105
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Automatic behavior composition synthesis
Pages 106-142
Giuseppe De Giacomo, Fabio Patrizi, Sebastian Sardiña
Volume 197, Pages 1-86 (April 2013)
Inconsistency measures for probabilistic logics
Pages 1-24
Matthias Thimm
Constraint propagation as information maximization
Pages 25-38
A. Nait Abdallah, M.H. van Emden
Transfer learning in heterogeneous collaborative filtering domains
Pages 39-55
Weike Pan, Qiang Yang
On the succinctness of some modal logics
Pages 56-85
Tim French, Wiebe van der Hoek, Petar Iliev, Barteld Kooi
Volume 198, Pages 1-104 (May 2013)
Probability and time
Pages 1-51
Marco Zaffalon, Enrique Miranda
On the complexity of planning for agent teams and its implications for single agent planning
Pages 52-71
Ronen I. Brafman, Carmel Domshlak
First competition section paper published
Page 72
G. Lakemeyer
Evaluating practical negotiating agents: Results and analysis of the 2011 international competition
Pages 73-103
Tim Baarslag, Katsuhide Fujita, Enrico H. Gerding, Koen Hindriks,
Takayuki Ito, Nicholas R. Jennings, Catholijn Jonker, Sarit Kraus, Raz
Lin, Valentin Robu, Colin R. Williams
Volumes 199–200, Pages 1-124 (June–July 2013)
Increasing threshold search for best-valued agents
Pages 1-21
Simon Shamoun, David Sarne
On the consistency of multi-label learning
Pages 22-44
Wei Gao, Zhi-Hua Zhou
Lifting integrity constraints in binary aggregation
Pages 45-66
Umberto Grandi, Ulle Endriss
How much does it help to know what she knows you know? An agent-based simulation study
Pages 67-92
Harmen de Weerd, Rineke Verbrugge, Bart Verheij
Volume 201, Pages 1-106 (August 2013)
Belief functions on distributive lattices
Pages 1-31
Chunlai Zhou
Qualitative constraint satisfaction problems: An extended framework with landmarks
Pages 32-58
Sanjiang Li, Weiming Liu, Shengsheng Wang
Minimal change: Relevance and recovery revisited
Pages 59-80
Márcio M. Ribeiro, Renata Wassermann, Giorgos Flouris, Grigoris Antoniou
Multiple instance classification: Review, taxonomy and comparative study Review Article
Pages 81-105
Jaume Amores
Volume 202, Pages 1-132 (September 2013)
Parametric properties of ideal semantics
Pages 1-28
Paul E. Dunne, Wolfgang Dvořák, Stefan Woltran
On the conditional independence implication problem: A lattice-theoretic approach
Pages 29-51
Mathias Niepert, Marc Gyssens, Bassem Sayrafi, Dirk Van Gucht
POMDP-based control of workflows for crowdsourcing
Pages 52-85
Peng Dai, Christopher H. Lin, Mausam, Daniel S. Weld
Interpolative and extrapolative reasoning in propositional theories using qualitative knowledge about conceptual spaces
Pages 86-131
Steven Schockaert, Henri Prade
Volume 203, Pages 1-150 (October 2013)
On the doubt about margin explanation of boosting
Pages 1-18
Wei Gao, Zhi-Hua Zhou
Complexity issues related to propagation completeness
Pages 19-34
Martin Babka, Tomáš Balyo, Ondřej Čepek, Štefan Gurský, Petr Kučera, Václav Vlček
Teaching and leading an ad hoc teammate: Collaboration without pre-coordination
Pages 35-65
Peter Stone, Gal A. Kaminka, Sarit Kraus, Jeffrey S. Rosenschein, Noa Agmon
Model-theoretic inseparability and modularity of description logic ontologies
Pages 66-103
Boris Konev, Carsten Lutz, Dirk Walther, Frank Wolter
Automata for infinite argumentation structures
Pages 104-150
Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin
Volume 204, Pages 1-120 (November 2013)
Computing cooperative solution concepts in coalitional skill games
Pages 1-21
Yoram Bachrach, David C. Parkes, Jeffrey S. Rosenschein
Speeding up many-objective optimization by Monte Carlo approximations
Pages 22-29
Karl Bringmann, Tobias Friedrich, Christian Igel, Thomas Voß
Type Extension Trees for feature construction and learning in relational domains
Pages 30-55
Manfred Jaeger, Marco Lippi, Andrea Passerini, Paolo Frasconi
End-user feature labeling: Supervised and semi-supervised approaches based on locally-weighted logistic regression
Pages 56-74
Shubhomoy Das, Travis Moore, Weng-Keen Wong, Simone Stumpf, Ian Oberst, Kevin McIntosh, Margaret Burnett
Local search for Boolean Satisfiability with configuration checking and subscore
Pages 75-98
Shaowei Cai, Kaile Su
An analysis on recombination in multi-objective evolutionary optimization
Pages 99-119
Chao Qian, Yang Yu, Zhi-Hua Zhou
Volume 205, Pages 1-70 (December 2013)
Evidential reasoning rule for evidence combination
Pages 1-29
Jian-Bo Yang, Dong-Ling Xu
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
Pages 30-38
Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon
Approximating operators and semantics for abstract dialectical frameworks
Pages 39-70
Hannes Strass
Volume 206, Pages 1-112 (January 2014)
Lost in translation: Language independence in propositional logic – application to belief change
Pages 1-24
Pierre Marquis, Nicolas Schwind
CROSS cyclic resource-constrained scheduling solver
Pages 25-52
Alessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano
Complexity-sensitive decision procedures for abstract argumentation
Pages 53-78
Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
Algorithm runtime prediction: Methods & evaluation
Pages 79-111
Frank Hutter, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
Volume 207, Pages 1-100 (February 2014)
Relating constraint answer set programming languages and algorithms
Pages 1-22
Yuliya Lierler
Algorithms for decision problems in argument systems under preferred semantics
Pages 23-51
Samer Nofal, Katie Atkinson, Paul E. Dunne
Linked taxonomies to capture usersʼ subjective assessments of items to facilitate accurate collaborative filtering
Pages 52-68
Makoto Nakatsuji, Yasuhiro Fujiwara
The complexity of manipulative attacks in nearly single-peaked electorates
Pages 69-99
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Volume 208, Pages 1-66 (March 2014)
The actorʼs view of automated planning and acting: A position paper
Pages 1-17
Malik Ghallab, Dana Nau, Paolo Traverso
Hidden protocols: Modifying our expectations in an evolving world
Pages 18-40
Hans van Ditmarsch, Sujata Ghosh, Rineke Verbrugge, Yanjing Wang
Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents
Pages 41-65
Somchaya Liemhetcharat, Manuela Veloso
Volume 209, Pages 1-78 (April 2014)
A logic for reasoning about ambiguity
Pages 1-10
Joseph Y. Halpern, Willemien Kets
Concept drift detection via competence models
Pages 11-28
Ning Lu, Guangquan Zhang, Jie Lu
Consequence-based and fixed-parameter tractable reasoning in description logics
Pages 29-77
František Simančík, Boris Motik, Ian Horrocks
Volume 210, Pages 1-122 (May 2014)
An event-based distributed diagnosis framework using structural model decomposition
Pages 1-35
Anibal Bregon, Matthew Daigle, Indranil Roychoudhury, Gautam Biswas, Xenofon Koutsoukos, Belarmino Pulido
Limitations of acyclic causal graphs for planning
Pages 36-55
Anders Jonsson, Peter Jonsson, Tomas Lööw
On the tractability of minimal model computation for some CNF theories
Pages 56-77
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti, Luigi Palopoli
The dropout learning algorithm
Pages 78-122
Pierre Baldi, Peter Sadowski
Volume 211, Pages 1-74 (June 2014)
Generating custom propagators for arbitrary constraints
Pages 1-33
Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel, Peter Nightingale
A branch and prune algorithm for the computation of generalized aspects of parallel robots
Pages 34-50
S. Caro, D. Chablat, A. Goldsztejn, D. Ishii, C. Jermann
CTL update of Kripke models through protections
Pages 51-74
Miguel Carrillo, David A. Rosenblueth
Volume 212, pp. 1-158 (July 2014)
Explorative anytime local search for distributed constraint optimization
Pages 1-26
Roie Zivan, Steven Okamoto, Hilla Peled
On our best behaviour
Pages 27-35
Hector J. Levesque
On the revision of informant credibility orders
Pages 36-58
Luciano H. Tamargo, Alejandro J. Garc°a, Marcelo A. Falappa, Guillermo R. Simari
Computational protein design as an optimization problem
Pages 59-79
David Allouche, Isabelle AndrÇ, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steve Prestwich, Thomas Schiex, Seydou TraorÇ
Action-model acquisition for planning via transfer learning
Pages 80-103
Hankz Hankui Zhuo, Qiang Yang
On topology-related properties of abstract argumentation semantics. A correction and extension to Dynamics of argumentation systems: A division-based method
Pages 104-115
Pietro Baroni, Massimiliano Giacomin, Beishui Liao
Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem
Pages 116-133
Jean-Guillaume Fages, Tanguy Lapägue
Learning hierarchical task network domains from partially observed plan traces
Pages 134-157
Hankz Hankui Zhuo, HÇctor Mu§oz-Avila, Qiang Yang
Volume 213, pp. 1-60 (August 2014)
FLP answer set semantics without circular justifications for general logic programs Pages 1-41
Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner, Jun Deng
The price of query rewriting in ontology-based data access
Pages 42-59
Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Thomas Schwentick, Michael Zakharyaschev
Volume 214, pp. 1-112 (September 2014)
Potential-based bounded-cost search and Anytime Non-Parametric image
Pages 1-25
Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah, Ken Goldberg
Flexibility and decoupling in Simple Temporal Networks
Pages 26-44
Michel Wilson, Tomas Klos, Cees Witteveen, Bob Huisman
Joint search with self-interested agents and the failure of cooperation enhancers
Pages 45-65
Igor Rochlin, David Sarne, Moshe Mash
Logical characterizations of regular equivalence in weighted social networks
Pages 66-88
Tuan-Fang Fan, Churn-Jung Liau
Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
Pages 89-111
Long Tran-Thanh, Sebastian Stein, Alex Rogers, Nicholas R. Jennings
Volume 215, pp. 1-140 (October 2014)
Fractals and Ravens
Pages 1-23
Keith McGreggor, Maithilee Kunda, Ashok Goel
On the choice of obtaining and disclosing the common value in auctions
Pages 24-54
David Sarne, Shani Alkoby, Esther David
Multicategory large margin classification methods: Hinge losses vs. coherence functions
Pages 55-78
Zhihua Zhang, Cheng Chen, Guang Dai, Wu-Jun Li, Dit-Yan Yeung
On influence, stable behavior, and the most influential individuals in networks: A game-theoretic approach
Pages 79-119
Mohammad T. Irfan, Luis E. Ortiz
(Non-)Succinctness of uniform interpolants of general terminologies in the description logic image
Pages 120-140
Nadeschda Nikitina, Sebastian Rudolph
Volume 216, pp. 1-326 (November 2014)
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Pages 1-19
Serge Gaspers, Stefan Szeider
A general framework for sound assumption-based argumentation dialogues
Pages 20-54
Xiuyi Fan, Francesca Toni
Modeling the complex dynamics and changing correlations of epileptic events
Pages 55-75
Drausin F. Wulsin, Emily B. Fox, Brian Litt
Online Transfer Learning
Pages 76-102
Peilin Zhao, Steven C.H. Hoi, Jialei Wang, Bin Li
Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
Pages 103-128
Luis C. Cobo, Kaushik Subramanian, Charles L. Isbell Jr., Aaron D. Lanterman, Andrea L. Thomaz
Disjunctive closures for knowledge compilation
Pages 129-162
HÇläne Fargier, Pierre Marquis
On the value of using group discounts under price competition
Pages 163-178
Reshef Meir, Tyler Lu, Moshe Tennenholtz, Craig Boutilier
Depth-based short-sighted stochastic shortest path problems
Pages 179-205
Felipe W. Trevizan, Manuela M. Veloso
Plan aggregation for strong cyclic planning in nondeterministic domains
Pages 206-232
Ron Alford, Ugur Kuter, Dana Nau, Robert P. Goldman
Finding explanations of inconsistency in multi-context systems
Pages 233-274
Thomas Eiter, Michael Fink, Peter SchÅller, Antonius Weinzierl
The unbiased black-box complexity of partition is polynomial
Pages 275-286
Benjamin Doerr, Carola Doerr, Timo Kîtzing
Better redistribution with inefficient allocation in multi-unit auctions
Pages 287-308
Mingyu Guo, Vincent Conitzer
Algorithms for computing minimal equivalent subformulas
Pages 309-326
Anton Belov, Mikol†? Janota, Inàs Lynce, Joao Marques-Silva
Volume 217, pp. 1-216 (December 2014)
An unsupervised training method for non-intrusive appliance load monitoring
Pages 1-19
Oliver Parson, Siddhartha Ghosh, Mark Weal, Alex Rogers
Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
Pages 20-42
Jessica Davies, George Katsirelos, Nina Narodytska, Toby Walsh, Lirong Xia
Spatial reasoning with image and connectedness constraints in Euclidean spaces
Pages 43-75
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev
Relations of epistemic proximity for belief change
Pages 76-91
Sven Ove Hansson
Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
Pages 92-116
Edward J. Powley, Peter I. Cowling, Daniel Whitehouse
kLog: A language for logical and relational learning with kernels
Pages 117-143
Paolo Frasconi, Fabrizio Costa, Luc De Raedt, Kurt De Grave
On the Input/Output behavior of argumentation frameworks
Pages 144-197
Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert van der Torre, Serena Villata
Eliciting good teaching from humans for machine learners
Pages 198-215
Maya Cakmak, Andrea L. Thomaz
Volume 218, pp. 1-106 (January 2015)
Belief revision in Horn theories
Pages 1-22
James P. Delgrande, Pavlos Peppas
The limits of decidability in fuzzy description logics with general concept inclusions
Pages 23-55
Stefan Borgwardt, Felix Distel, Rafael Pe§aloza
Most frugal explanations in Bayesian networks
Pages 56-73
Johan Kwisthout
Realizing RCC8 networks using convex regions
Pages 74-105
Steven Schockaert, Sanjiang Li
Volume 219, pp. 1-92 (February 2015)
Subdimensional expansion for multirobot path planning
Pages 1-24
Glenn Wagner, Howie Choset
Learning pseudo-tags to augment sparse tagging in hybrid music recommender systems
Pages 25-39
Ben Horsburgh, Susan Craw, Stewart Massie
Conflict-based search for optimal multi-agent pathfinding
Pages 40-66
Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant
Integrating representation learning and skill learning in a human-like intelligent agent
Pages 67-91
Nan Li, Noboru Matsuda, William W. Cohen, Kenneth R. Koedinger
Volume 220, pp. 1-124 (March 2015)
STR3: A path-optimal filtering algorithm for table constraints
Pages 1-27
Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H.C. Yap
Backdoors to tractable answer set programming
Pages 64-103
Johannes Klaus Fichte, Stefan Szeider
Speeding up operations on feature terms using constraint programming and variable symmetry
Pages 104-120
Santiago Onta§¢n, Pedro Meseguer
Ethical guidelines for a superintelligence
Pages 121-124
Ernest Davis
Volume 221, Pages 1-114 (April 2015)
Asynchronous knowledge with hidden actions in the situation calculus
Pages 1-35
Ryan F. Kelly, Adrian R. Pearce
POMDPs under probabilistic semantics
Pages 46-72
Krishnendu Chatterjee, Martin Chmel°k
Red?black planning: A new systematic approach to partial delete relaxation
Pages 73-114
Carmel Domshlak, Jîrg Hoffmann, Michael Katz
Volume 222, Pages 1-200 (May 2015)
A new semantics for overriding in description logics
Pages 1-48
P.A. Bonatti, M. Faella, I.M. Petrova, L. Sauro
Finding core for coalition structure utilizing dual solution
Pages 49-66
Atsushi Iwasaki, Suguru Ueda, Naoyuki Hashimoto, Makoto Yokoo
Achieving fully proportional representation: Approximability results
Pages 67-103
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
Moving average reversion strategy for on-line portfolio selection
Pages 104-123
Bin Li, Steven C.H. Hoi, Doyen Sahoo, Zhi-Yong Liu
Playing with knowledge: A virtual player for ?Who Wants to Be a Millionaire?? that leverages question answering techniques
Pages 157-181
Piero Molino, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Pierpaolo Basile
Volume 223, Pages 1-156 (June 2015)
Semantical considerations on multiagent only knowing
Pages 1-26
Vaishak Belle, Gerhard Lakemeyer
Modular robotic systems: Methods and algorithms for abstraction, planning, control, and synchronization
Pages 27-64
Hossein Ahmadzadeh, Ellips Masehian
Optimizing ontology alignments through a Memetic Algorithm using both MatchFmeasure and Unanimous Improvement Ratio
Pages 65-81
Xingsi Xue, Yuping Wang
The deterministic part of the seventh International Planning Competition
Pages 82-119
Carlos Linares López, Sergio Jiménez Celorrio, Ángel García Olaya
Overview and analysis of the SAT Challenge 2012 solver competition
Pages 120-155
Adrian Balint, Anton Belov, Matti Järvisalo, Carsten Sinz
Volume 224, Pages 1-118 (July 2015)
An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
Pages 1-27
Alessandro Cimatti, Andrea Micheli, Marco Roveri
Efficient nonconvex sparse group feature selection via continuous and discrete optimization
Pages 28-50
Shuo Xiang, Xiaotong Shen, Jieping Ye
Grounded fixpoints and their applications in knowledge representation
Pages 51-71
Bart Bogaerts, Joost Vennekens, Marc Denecker
Ordered completion for logic programs with aggregates
Pages 72-102
Vernon Asuncion, Yin Chen, Yan Zhang, Yi Zhou
Computer-aided proof of Erdős discrepancy properties
Pages 103-118
Boris Konev, Alexei Lisitsa
Volume 225, Pages 1-76 (August 2015)
Incorporating weights into real-time heuristic search
Pages 1-23
Nicolás Rivera, Jorge A. Baier, Carlos Hernández
Framing reinforcement learning from human reward: Reward positivity, temporal discounting, episodicity, and performance
Pages 24-50
W. Bradley Knox, Peter Stone
On redundant topological constraints
Pages 51-76
Sanjiang Li, Zhiguo Long, Weiming Liu, Matt Duckham, Alan Both
Volume 226, Pages 1-122 (September 2015)
Semantic characterization of rational closure: From propositional logic to description logics
Pages 1-33
L. Giordano, V. Gliozzi, N. Olivetti, G.L. Pozzato
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
Pages 34-74
Hannes Strass, Johannes Peter Wallner
Automatic construction of optimal static sequential portfolios for AI planning and beyond
Pages 75-101
Sergio Núñez, Daniel Borrajo, Carlos Linares López
Transferring knowledge as heuristics in reinforcement learning: A case-based approach
Pages 102-121
Reinaldo A.C. Bianchi, Luiz A. Celiberto Jr., Paulo E. Santos, Jackson P. Matsuura, Ramon Lopez de Mantaras
Volume 227, Pages 1-246 (October 2015)
A generic approach to planning in the presence of incomplete information: Theory and implementation
Pages 1-51
Son Thanh To, Tran Cao Son, Enrico Pontelli
Optimal Sokoban solving using pattern databases with specific domain knowledge
Pages 52-70
André G. Pereira, Marcus Ritt, Luciana S. Buriol
Fair assignment of indivisible objects under ordinal preferences
Pages 71-92
Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
Pages 93-139
Nicola Gatti, Alessandro Lazaric, Marco Rocco, Francesco Trovò
Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
Pages 140-164
Glauber De Bona, Marcelo Finger
Volume 228, Pages 1-216 (November 2015)
A new probabilistic constraint logic programming language based on a generalised distribution semantics
Pages 1-44
Steffen Michels, Arjen Hommersom, Peter J.F. Lucas, Marina Velikova
Bi-goal evolution for many-objective optimization problems
Pages 45-65
Miqing Li, Shengxiang Yang, Xiaohui Liu
Inducing semantic relations from conceptual spaces: A data-driven approach to plausible reasoning
Pages 66-94
Joaquín Derrac, Steven Schockaert
From senses to texts: An all-in-one graph-based approach for measuring semantic similarity
Pages 95-128
Mohammad Taher Pilehvar, Roberto Navigli
Confidence-based reasoning in stochastic constraint programming
Pages 129-152
Roberto Rossi, Brahim Hnich, S. Armagan Tarim, Steven Prestwich
Characteristics of multiple viewpoints in abstract argumentation
Pages 153-178
Paul E. Dunne, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran
Feature assembly method for extracting relations in Chinese
Pages 179-194
Yanping Chen, Qinghua Zheng, Ping Chen
Revision in networks of ontologies
Pages 195-216
Jérôme Euzenat
Volume 229, Pages 1-282 (December 2015)
The complexity of reasoning with FODD and GFODD
Pages 1-32
Benjamin J. Hescott, Roni Khardon
On updates of hybrid knowledge bases composed of ontologies and rules
Pages 33-104
Martin Slota, João Leite, Theresa Swift
Variable symmetry breaking in numerical constraint problems
Pages 105-125
Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras
Relevance in belief revision
Pages 126-138
Pavlos Peppas, Mary-Anne Williams, Samir Chopra, Norman Foo
Modelling structured societies: A multi-relational approach to context permeability
Pages 175-199
Davide Nunes, Luis Antunes
Does the world look different in different languages?
Pages 202-209
Ernest Davis
An extension of metric temporal planning with application to AC voltage control
Pages 210-245
Chiara Piacentini, Varvara Alimisis, Maria Fox, Derek Long
Learning Boolean specifications
Pages 246-257
U. Bubeck, H. Kleine Büning
RoboCup@Home: Analysis and results of evolving competitions for domestic and service robots
Pages 258-281
Luca Iocchi, Dirk Holz, Javier Ruiz-del-Solar, Komei Sugiura, Tijn van der Zant
Volume 230,
Pages 1-246 (January 2016)
Semi-supervised combination of experts for aerosol optical depth estimation
Pages 1-13
Nemanja Djuric, Lakesh Kansakar, Slobodan Vucetic
A hybrid exact algorithm for complete set partitioning
Pages 14-50
Tomasz Michalak, Talal Rahwan, Edith Elkind, Michael Wooldridge, Nicholas R. Jennings
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
Pages 51-73
Levi H.S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte
Computer models solving intelligence test problems: Progress and implications
Pages 74-107
José Hernández-Orallo, Fernando Martínez-Plumed, Ute Schmid, Michael Siebers, David L. Dowe
A concept drift-tolerant case-base editing technique
Pages 108-133
Ning Lu, Jie Lu, Guangquan Zhang, Ramon Lopez de Mantaras
Affect control processes: Intelligent affective interaction using a partially observable Markov decision process
Pages 134-172
Jesse Hoey, Tobias Schröder, Areej Alhothali
Exploiting meta features for dependency parsing and part-of-speech tagging
Pages 173-191
Wenliang Chen, Min Zhang, Yue Zhang, Xiangyu Duan
Real-time dynamic programming for Markov decision processes with imprecise probabilities
Pages 192-223
Karina V. Delgado, Leliane N. de Barros, Daniel B. Dias, Scott Sanner
Semantic sensitive tensor factorization
Pages 224-245
Makoto Nakatsuji, Hiroyuki Toda, Hiroshi Sawada, Jin Guang Zheng, James A. Hendler
Volume 231, Pages 1-182 (February 2016)
Voting rules as error-correcting codes
Pages 1-16
Ariel D. Procaccia, Nisarg Shah, Yair Zick
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited
Pages 17-38
C.E. Larson, N. Van Cleemput
Efficient algorithms for game-theoretic betweenness centrality
Pages 39-63
Piotr L. Szczepański, Tomasz P. Michalak, Talal Rahwan
Agent planning programs
Pages 64-106
Giuseppe De Giacomo, Alfonso Emilio Gerevini, Fabio Patrizi, Alessandro Saetti, Sebastian Sardina
An axiomatic analysis of structured argumentation with priorities
Pages 107-150
Phan Minh Dung
Not entitled to full text
Design and results of the Fifth Answer Set Programming Competition
Pages 151-181
Francesco Calimeri, Martin Gebser, Marco Maratea, Francesco Ricca
Volume 232, Pages 1-114 (March 2016)
Certain answers as objects and knowledge
Pages 1-19
Leonid Libkin
SATenstein: Automatically building local search SAT solvers from components
Pages 20-42
Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
Exploiting local and repeated structure in Dynamic Bayesian Networks
Pages 43-53
Jonas Vlasselaer, Wannes Meert, Guy Van den Broeck, Luc De Raedt
Topic-based term translation models for statistical machine translation
Pages 54-75
Deyi Xiong, Fandong Meng, Qun Liu
Characteristic function games with restricted agent interactions: Core-stability and coalition structuresPages 76-113
Georgios Chalkiadakis, Gianluigi Greco, Evangelos Markakis
Volume 233, Pages 1-142 (April 2016)
Argument graphs and assumption-based argumentation
Pages 1-59
Robert Craven, Francesca Toni
On the query complexity of selecting minimal sets for monotone predicates
Pages 73-83
Mikoláš Janota, Joao Marques-Silva
Domain expansion for ASP-programs with external sources
Pages 84-121
Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl
Construction of system of spheres-based transitively relational partial meet multiple contractions: An impossibility result
Pages 122-141
Maurício D.L. Reis, Eduardo Fermé, Pavlos Peppas
Volume 234, Pages 1-272 (May 2016)
Solving QBF with counterexample guided refinement
Pages 1-25
Mikoláš Janota, William Klieber, Joao Marques-Silva, Edmund Clarke
Optimal cost almost-sure reachability in POMDPs
Pages 26-48
Krishnendu Chatterjee, Martin Chmelík, Raghav Gupta, Ayush Kanodia
Truncated incremental search
Pages 49-77
Sandip Aine, Maxim Likhachev
Games for query inseparability of description logic knowledge bases
Pages 78-119
Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
On the expressivity of inconsistency measures
Pages 120-151
Matthias Thimm
Parameterised verification for multi-agent systems
Pages 152-189
Panagiotis Kouvaros, Alessio Lomuscio
The co-occurrence test for non-monotonic inference
Pages 190-195
Sven Ove Hansson
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems
Pages 196-218
Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini
Semi-equilibrium models for paracoherent answer set programs
Pages 219-271
Giovanni Amendola, Thomas Eiter, Michael Fink, Nicola Leone, João Moura
Volume 235, Pages 1-182 (June 2016)
A formalization of programs in first-order logic with a discrete linear order
Pages 1-25
Fangzhen Lin
MaxSAT by improved instance-specific algorithm configuration
Pages 26-39
Carlos Ansótegui, Joel Gabàs, Yuri Malitsky, Meinolf Sellmann
Strategyproof matching with regional minimum and maximum quotas
Pages 40-57
Masahiro Goto, Atsushi Iwasaki, Yujiro Kawasaki, Ryoji Kurata, Yosuke Yasuda, Makoto Yokoo
The multifaceted impact of Ada Lovelace in the digital age
Pages 58-62
Luigia Carlucci Aiello
Belief and truth in hypothesised behaviours
Pages 63-94
Stefano V. Albrecht, Jacob W. Crandall, Subramanian Ramamoorthy
Tractable approximate deduction for OWL
Pages 95-155
Jeff Z. Pan, Yuan Ren, Yuting Zhao
e-NSP: Efficient negative sequential pattern mining
Pages 156-182
Longbing Cao, Xiangjun Dong, Zhigang Zheng
Volume 236, Pages 1-118 (July 2016)
One-pass AUC optimization
Pages 1-29
Wei Gao, Lu Wang, Rong Jin, Shenghuo Zhu, Zhi-Hua Zhou
Domain-independent planning for services in uncertain and dynamic environments
Pages 30-64
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
On abstract modular inference systems and solvers
Pages 65-89
Yuliya Lierler, Miroslaw Truszczynski
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
Pages 90-118
Mark Kaminski, Yavor Nenov, Bernardo Cuenca Grau
Volume 237, Pages 1-228 (August 2016)
Algorithms for computing strategies in two-player simultaneous move games
Pages 1-40
Branislav Bošanský, Viliam Lisý, Marc Lanctot, Jiří Čermák, Mark H.M. Winands
ASlib: A benchmark library for algorithm selection
Pages 41-58
Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fréchette, Holger Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren
POPPONENT: Highly accurate, individually and socially efficient opponent preference model in bilateral multi issue negotiations
Pages 59-91
Farhad Zafari, Faria Nassiri-Mofakham
The QBF Gallery: Behind the scenes
Pages 92-114
Florian Lonsing, Martina Seidl, Allen Van Gelder
Evaluating epistemic negation in answer set programming
Pages 115-135
Yi-Dong Shen, Thomas Eiter
Querying incomplete information in RDF with SPARQL
Pages 138-171
Charalampos Nikolaou, Manolis Koubarakis
Bounded situation calculus action theories
Pages 172-203
Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi
Hierarchical conceptual spaces for concept combination
Pages 204-227
Martha Lewis, Jonathan Lawry
Volume 238, Pages 1-190 (September 2016)
A qualitative spatial representation of string loops as holes
Pages 1-10
Pedro Cabalar, Paulo E. Santos
Knowledge base exchange: The case of OWL 2 QL
Pages 11-62
Marcelo Arenas, Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov
Robust multilingual Named Entity Recognition with shallow semi-supervised features
Pages 63-82
Rodrigo Agerri, German Rigau
Smooth sparse coding via marginal regression for learning sparse representations
Pages 83-95
Krishnakumar Balasubramanian, Kai Yu, Guy Lebanon
Making the right exceptions
Pages 96-118
Harald Bastiaanse, Frank Veltman
Generating SAT instances with community structure
Pages 119-134
Jesús Giráldez-Cru, Jordi Levy
Learning general constraints in CSP
Pages 135-153
Michael Veksler, Ofer Strichman
Volume 239, Pages 1-168 (October 2016)
Algorithms and everyday life
Pages 1-6
Ernest Davis
Data repair of inconsistent nonmonotonic description logic programs
Pages 7-53
Thomas Eiter, Michael Fink, Daria Stepanova
Extracting qualitative relations from categorical data
Pages 54-69
Jure Žabkar, Ivan Bratko, Janez Demšar
Diffusion centrality: A paradigm to maximize spread in social networks
Pages 70-96
Chanhyun Kang, Sarit Kraus, Cristian Molinaro, Francesca Spezzano, V.S. Subrahmanian
Norm-based mechanism design
Pages 97-142
Nils Bulling, Mehdi Dastani
Building knowledge maps of Web graphs
Pages 143-167
Valeria Fionda, Claudio Gutierrez, Giuseppe Pirrò
Volume 240, Pages 1-104 (November 2016)
New local search methods for partial MaxSAT
Pages 1-18
Shaowei Cai, Chuan Luo, Jinkun Lin, Kaile Su
H-index manipulation by merging articles: Models, theory, and experiments
Pages 19-35
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
Nasari: Integrating explicit knowledge and corpus statistics for a multilingual representation of concepts and entities
Pages 36-64
José Camacho-Collados, Mohammad Taher Pilehvar, Roberto Navigli
Comparing human behavior models in repeated Stackelberg security games: An extended studyO
Pages 65-103
Debarun Kar, Fei Fang, Francesco M. Delle Fave, Nicole Sintov, Milind Tambe, Arnaud Lyet
Volume 241, Pages 1-284 (December 2016)
Integrating social power into the decision-making of cognitive agents
Pages 1-44
Gonçalo Pereira, Rui Prada, Pedro A. Santos
SAT Race 2015
Pages 45-65
Tomáš Balyo, Armin Biere, Markus Iser, Carsten Sinz
MultiWiBi: The multilingual Wikipedia bitaxonomy project
Pages 66-102
Tiziano Flati, Daniele Vannella, Tommaso Pasini, Roberto Navigli
A synthesis of automated planning and reinforcement learning for efficient, robust decision-making
Pages 103-130
Matteo Leonetti, Luca Iocchi, Peter Stone
Online belief tracking using regression for contingent planning
Pages 131-152
Ronen I. Brafman, Guy Shani
Computing and restoring global inverse consistency in interactive constraint satisfaction
Pages 153-169
Christian Bessiere, Hélène Fargier, Christophe Lecoutre
A parametric propagator for pairs of Sum constraints with a discrete convexity property
Pages 170-190
Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson
Finding a collective set of items: From proportional multirepresentation to group recommendation
Pages 191-216
Piotr Skowron, Piotr Faliszewski, Jérôme Lang
Generalized mirror descents in congestion games
Pages 217-243
Po-An Chen, Chi-Jen Lu
On rejected arguments and implicit conflicts: The hidden power of argumentation semantics
Pages 244-284
Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Christof Spanring, Hannes Strass, Stefan Woltran
Volume 242, Pages 1-172 (January 2017)
Distributed fair allocation of indivisible goods
Pages 1-22
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
A model of language learning with semantics and meaning-preserving corrections
Pages 23-51
Dana Angluin, Leonor Becerra-Bonache
Efficient symbolic search for cost-optimal planning
Pages 52-79
Álvaro Torralba, Vidal Alcázar, Peter Kissmann, Stefan Edelkamp
Arbitrary arrow update logic
Pages 80-106
Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer
An approach to decision making based on dynamic argumentation systems
Pages 107-131
Edgardo Ferretti, Luciano H. Tamargo, Alejandro J. García, Marcelo L. Errecalde, Guillermo R. Simari
Making friends on the fly: Cooperating with new teammates
Pages 132-171
Samuel Barrett, Avi Rosenfeld, Sarit Kraus, Peter Stone
Volume 243, Pages 1-56 (February 2017)
The Configurable SAT Solver Challenge (CSSC)
Pages 1-25
Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos, Kevin Leyton-Brown
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
Pages 26-44
Chuan Luo, Shaowei Cai, Kaile Su, Wenxuan Huang
Query efficient posterior estimation in scientific experiments via Bayesian active learning
Pages 45-56
Kirthevasan Kandasamy, Jeff Schneider, Barnabás Póczos
Volume 244, Pages 1-396 (March 2017)
Combining Constraint Solving with Mining and Learning
Edited by Andrea Passerini, Guido Tack and Tias Guns
Introduction to the special issue on Combining Constraint Solving with Mining and Learning
Pages 1-5
Andrea Passerini, Guido Tack, Tias Guns
MiningZinc: A declarative framework for constraint-based mining
Pages 6-29
Tias Guns, Anton Dries, Siegfried Nijssen, Guido Tack, Luc De Raedt
Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems
Pages 48-69
Willy Ugarte, Patrice Boizumault, Bruno Crémilleux, Alban Lepailleur, Samir Loudni, Marc Plantevit, Chedy Raïssi, Arnaud Soulet
Constrained clustering by constraint programming
Pages 70-94
Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain
A flexible ILP formulation for hierarchical clustering
Pages 95-109
Sean Gilpin, Ian Davidson
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
Pages 110-142
Jeremias Berg, Matti Järvisalo
Semantic-based regularization for learning and inference
Pages 143-165
Michelangelo Diligenti, Marco Gori, Claudio Saccà
Structured learning modulo theories
Pages 166-187
Stefano Teso, Roberto Sebastiani, Andrea Passerini
Relational linear programming
Pages 188-216
Kristian Kersting, Martin Mladenov, Pavel Tokmakov
Learning an efficient constructive sampler for graphs
Pages 217-238
Fabrizio Costa
Learning Bayesian network parameters under equivalence constraints
Pages 239-257
Tiansheng Yao, Arthur Choi, Adnan Darwiche
Integer Linear Programming for the Bayesian network structure learning problem
Pages 258-271
Mark Bartlett, James Cussens
Automatic construction of parallel portfolios via algorithm configuration
Pages 272-290
Marius Lindauer, Holger Hoos, Kevin Leyton-Brown, Torsten Schaub
Alors: An algorithm recommender system
Pages 291-314
Mustafa Mısır, Michèle Sebag
Constraint acquisition
Pages 315-342
Christian Bessiere, Frédéric Koriche, Nadjib Lazaar, Barry O'Sullivan
Empirical decision model learning
Pages 343-367
Michele Lombardi, Michela Milano, Andrea Bartolini
Abstract Purchase PDF - $35.95
Not entitled to full text
Auction optimization using regression trees and linear models as integer programs
Pages 368-395
Sicco Verwer, Yingqian Zhang, Qing Chuan Ye