default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th ECAI 2020: Santiago de Compostela, Spain
- Giuseppe De Giacomo, Alejandro Catalá, Bistra Dilkina, Michela Milano, Senén Barro, Alberto Bugarín
, Jérôme Lang:
ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020). Frontiers in Artificial Intelligence and Applications 325, IOS Press 2020, ISBN 978-1-64368-100-9
Research Article
- Juan Afanador, Nir Oren, Murilo S. Baptista, Maria Araujo:
From Eigentrust to a Trust-Measuring Algorithm in the Max-Plus Algebra. 3-10 - Vincenzo Auletta, Giuseppe De Nittis, Diodato Ferraioli, Nicola Gatti, Domenico Longo:
Strategic Monitor Placement Against Malicious Flows. 11-18 - Vincenzo Auletta, Diodato Ferraioli, Gianluigi Greco:
On the Effectiveness of Social Proof Recommendations in Markets with Multiple Products. 19-26 - Francesco Belardinelli, Vadim Malvone:
Verifying Strategic Abilities in Multi-Agent Systems via First-Order Entailment. 27-34 - Vittorio Bilò, Michele Flammini, Cosimo Vinci:
The Quality of Content Publishing in the Digital Era. 35-42 - Can Kurtan, Pinar Yolum, Mehdi Dastani:
An Ideal Team Is More than a Team of Ideal Agents. 43-50 - Jeremias Dötterl, Ralf Bruns, Jürgen Dunkel, Sascha Ossowski:
On-Time Delivery in Crowdshipping Systems: An Agent-Based Approach Using Streaming Data. 51-58 - Marco Faella, Luigi Sauro:
Preferences over Rankings and How to Control Them Using Rewards. 59-66 - Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules with Variable Number of Winners. 67-74 - Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González:
From Public Announcements to Asynchronous Announcements. 75-82 - Zack Fitzsimmons, Edith Hemaspaandra:
Election Score Can Be Harder than Winner. 83-90 - Michele Flammini, Manuel Mauro, Matteo Tonelli, Cosimo Vinci:
Inequity Aversion Pricing in Multi-Unit Markets. 91-98 - Michele Flammini, Hugo Gilbert:
Parameterized Complexity of Manipulating Sequential Allocation. 99-106 - Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis:
Object Allocation and Positive Graph Externalities. 107-114 - Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games. 115-122 - Pallavi Jain, Nimrod Talmon:
Committee Selection with Multimodal Preferences. 123-130 - Boas Kluiving, Adriaan de Vries, Pepijn Vrijbergen, Arthur Boixel, Ulle Endriss:
Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving. 131-138 - Borja G. León, Francesco Belardinelli:
Extended Markov Games to Learn Multiple Tasks in Multi-Agent Reinforcement Learning. 139-146 - Hugo Martin, Patrice Perny:
New Computational Models for the Choquet Integral. 147-154 - Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri:
Dynamic Epistemic Logic Games with Epistemic Temporal Goals. 155-162 - Cynthia Maushagen, Jörg Rothe:
The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. 163-170 - Johannes Nauta, Stef Van Havermaet, Pieter Simoens, Yara Khaluf:
Enhanced Foraging in Robot Swarms Using Collective Lévy Walks. 171-178 - Thanh Hong Nguyen, Nam Vu, Amulya Yadav, Uy Nguyen:
Decoding the Imitation Security Game: Handling Attacker Imitative Behavior Deception. 179-186 - Thanh Hong Nguyen, Andrew Butler, Haifeng Xu:
Tackling Imitative Attacker Deception in Repeated Bayesian Stackelberg Security Games. 187-194 - Pierre Rust, Gauthier Picard, Fano Ramparany:
Resilient Distributed Constraint Optimization in Physical Multi-Agent Systems. 195-202 - Parham Shams, Aurélie Beynier, Sylvain Bouveret, Nicolas Maudet:
Fair in the Eyes of Others. 203-210 - Haomin Shi, Yao Zhang, Zilin Si, Letong Wang, Dengji Zhao:
Maximal Information Propagation with Budgets. 211-218 - Taiki Todo, Makoto Yokoo:
Split Manipulations in Cost Sharing of Minimum Cost Spanning Tree. 219-226 - Taiki Todo, Nodoka Okada, Makoto Yokoo:
False-Name-Proof Facility Location on Discrete Structures. 227-234 - Nic Wilson:
Voting Rules from Random Relations. 235-242 - Yongjie Yang:
On the Complexity of Constructive Control Under Nearly Single-Peaked Preferences. 243-250 - Wen Zhang, Dengji Zhao, Yao Zhang:
Incentivize Diffusion with Fair Rewards. 251-258 - Zhiqiang Zhuang, Kewen Wang, Junhu Wang, Heng Zhang, Zhe Wang, Zhiguo Gong:
Lifting Majority to Unanimity in Opinion Diffusion. 259-266 - Andrea Cascallar Fuentes, Alejandro Ramos-Soto, Alberto José Bugarín Diz:
An Experimental Study on the Behaviour of Fuzzy Quantification Models. 267-274 - Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann:
Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits. 275-282 - Hisao Ishibuchi, Lie Meng Pang, Ke Shang:
A New Framework of Evolutionary Multi-Objective Algorithms with an Unbounded External Archive. 283-290 - Hisao Ishibuchi, Takashi Matsumoto, Naoki Masuyama, Yusuke Nojima:
Many-Objective Problems Are Not Always Difficult for Pareto Dominance-Based Evolutionary Algorithms. 291-298 - Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann:
Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. 307-314 - Gilles Audemard, Christophe Lecoutre, Mehdi Maamar:
Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. 315-322 - Guillaume Claus, Hadrien Cambazard, Vincent Jost:
Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints. 323-330 - Gökberk Koçak, Özgür Akgün, Tias Guns, Ian Miguel:
Exploiting Incomparability in Solution Dominance: Improving General Purpose Constraint-Based Mining. 331-338 - Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev:
Speeding Up CDCL Inference with Duplicate Learnt Clauses. 339-346 - Marcus Leivo, Jeremias Berg, Matti Järvisalo:
Preprocessing in Incomplete MaxSAT Solving. 347-354 - Steve Prestwich:
Robust Constraint Acquisition by Sequential Analysis. 355-362 - Ruixin Wang, Nicolas Barnier:
Global Propagation of Transition Cost for Fixed Job Scheduling. 363-370 - Hugues Wattez, Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary:
Learning Variable Ordering Heuristics with Multi-Armed Bandits and Restarts. 371-378 - Oleg Zaikin, Alexey Ignatiev, João Marques-Silva:
Branch Location Problems with Maximum Satisfiability. 379-386 - Gal Cohensius, Reshef Meir, Nadav Oved, Roni Stern:
Bidding in Spades. 387-394 - Stefan Edelkamp:
Representing and Reducing Uncertainty for Enumerating the Belief Space to Improve Endgame Play in Skat. 395-402 - Francesco Morandin, Gianluca Amato, Marco Fantozzi, Rosa Gini, Carlo Metta, Maurizio Parton:
SAI: A Sensible Artificial Intelligence That Plays with Handicap and Targets High Scores in 9×9 Go. 403-410 - Éric Piette, Dennis J. N. J. Soemers, Matthew Stephenson, Chiara F. Sironi, Mark H. M. Winands, Cameron Browne:
Ludii - The Ludemic General Game System. 411-418 - Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators. 419-426 - André Biedenkapp, H. Furkan Bozkurt, Theresa Eimer, Frank Hutter, Marius Lindauer:
Dynamic Algorithm Configuration: Foundation of a New Meta-Algorithmic Framework. 427-434 - Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. 435-442 - André Hottung, Kevin Tierney:
Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem. 443-450 - Rishabh K. Iyer:
Robust Submodular Minimization with Applications to Cooperative Modeling. 451-458 - Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree Search for the Sequential Ordering Problem. 459-465 - Lucie Pansart, Hadrien Cambazard, Nicolas Catusse:
New Randomized Strategies for the Color Coding Algorithm. 466-473 - Xiao Dong, Huaxiang Zhang, Gianluca Demartini:
A Region Selection Model to Identify Unknown Unknowns in Image Datasets. 474-481 - Rajni Jindal, Maitree Leekha, Minkush Manuja, Mononito Goswami:
What Makes a Better Companion? Towards Social & Engaging Peer Learning. 482-489 - Tharindu Cyril Weerasooriya, Tong Liu, Christopher M. Homan:
Neighborhood-Based Pooling for Population-Level Label Distribution Learning. 490-497 - Nitin Yadav, Carsten Murawski, Sebastian Sardiña, Peter Bossaerts:
Is Hardness Inherent in Computational Problems? Performance of Human and Electronic Computers on Random Instances of the 0-1 Knapsack Problem. 498-505 - Chaochao Chen, Liang Li, Bingzhe Wu, Cheng Hong, Li Wang, Jun Zhou:
Secure Social Recommendation Based on Secret Sharing. 506-512 - Sebastian Hofstätter, Markus Zlabinger, Allan Hanbury:
Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking. 513-520 - Ming Liu, Jianxin Liao, Jingyu Wang, Qi Qi, Haifeng Sun:
Dual Attention-Based Adversarial Autoencoder for Attributed Network Embedding. 521-528 - Tianxin Wang, Jingwu Chen, Fuzhen Zhuang, Leyu Lin, Feng Xia, Lihuan Du, Qing He:
Capturing Attraction Distribution: Sequential Attentive Network for Dwell Time Prediction. 529-536 - Chaoyang Wang, Zhiqiang Guo, Jianjun Li, Peng Pan, Guohui Li:
A Text-Based Deep Reinforcement Learning Framework for Interactive Recommendation. 537-544 - Yong Xu, Jiahui Chen, Chao Huang, Bo Zhang, Hao Xing, Peng Dai, Liefeng Bo:
Joint Modeling of Local and Global Behavior Dynamics for Session-Based Recommendation. 545-552 - Yangjun Xu, Liang Chen, Fenfang Xie, Weibo Hu, Jieming Zhu, Chuan Chen, Zibin Zheng:
Directional Adversarial Training for Recommender Systems. 553-560 - Ye Yuan, Mingsheng Shang, Xin Luo:
Temporal Web Service QoS Prediction via Kalman Filter-Incorporated Latent Factor Analysis. 561-568 - Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Gilberto Pérez, Concepción Vidal:
Explicit Negation in Linear-Dynamic Equilibrium Logic. 569-576 - Gianvincenzo Alfano, Andrea Cohen, Sebastian Gottifredi, Sergio Greco, Francesco Parisi, Guillermo Ricardo Simari:
Dynamics in Abstract Argumentation Frameworks with Recursive Attack and Support Relations. 577-584 - Javier Álvez, Itziar Gonzalez-Dios, German Rigau:
Applying the Closed World Assumption to SUMO-Based FOL Ontologies for Effective Commonsense Reasoning. 585-592 - Leila Amgoud:
Evaluation of Analogical Arguments by Choquet Integral. 593-600 - Theofanis I. Aravanis, Pavlos Peppas, Mary-Anne Williams:
Modelling Belief-Revision Functions at Extended Languages. 601-607 - Ofer Arieli, Jesse Heyninck:
Prioritized Simple Contrapositive Assumption-Based Frameworks. 608-615 - Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph:
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. 616-623 - Francesco Belardinelli, Stéphane Demri:
Reasoning with a Bounded Number of Resources in ATL+. 624-631 - Nicola Bertoglio, Gianfranco Lamperti, Marina Zanella, Xiangfu Zhao:
Diagnosis of Temporal Faults in Discrete-Event Systems. 632-639 - Bart Bogaerts, Emilio Gamba, Jens Claes, Tias Guns:
Step-Wise Explanations of Constraint Satisfaction Problems. 640-647 - Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis, Valentin Montmirail:
Consolidating Modal Knowledge Bases. 648-655 - Pedro Cabalar, Martín Diéguez, Torsten Schaub, François Laferrière:
Implementing Dynamic Answer Set Programming over Finite Traces. 656-663 - Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
An ASP Semantics for Constraints Involving Conditional Aggregates. 664-671 - Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Explanations for Ontology-Mediated Query Answering in Description Logics. 672-679 - Eleonora Chiodino, Davide Di Luccio, Antonio Lieto, Alberto Messina, Gian Luca Pozzato, Davide Rubinetti:
A Knowledge-Based System for the Dynamic Generation and Classification of Novel Contents in Multimedia Broadcasting. 680-687 - Quentin Cohen-Solal:
Minimality of Combined Qualitative Constraint Networks. 688-695 - Willem Conradie, Dario Della Monica, Emilio Muñoz-Velasco, Guido Sciavicco:
An Approach to Fuzzy Modal Logic of Time Intervals. 696-703 - Carl Corea, Matthias Thimm:
Towards Inconsistency Measurement in Business Rule Bases. 704-711 - Adnan Darwiche, Auguste Hirth:
On the Reasons Behind Decisions. 712-720 - Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks. 721-728 - Thomas Eiter, Rafael Kiesel:
Weighted LARS for Quantitative Stream Reasoning. 729-736 - Bettina Fazzinga, Sergio Flesca, Filippo Furfaro:
Embedding the Trust Degrees of Agents in Abstract Argumentation. 737-744 - Tomasz Gogacz, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Filip Murlak, Magdalena Ortiz, Mantas Simkus:
Ontology Focusing: Knowledge-Enriched Databases on Demand. 745-752 - Andreas Herzig, Emiliano Lorini, Elise Perrotin, Fabián Romero, François Schwarzentruber:
A Logic of Explicit and Implicit Distributed Belief. 753-760 - Till Hofmann, Tim Niemueller, Gerhard Lakemeyer:
Macro Operator Synthesis for ADL Domains. 761-768 - Anthony Hunter:
Generating Instantiated Argument Graphs from Probabilistic Information. 769-776 - Martin Jedwabny, Madalina Croitoru, Pierre Bisquert:
Gradual Semantics for Logic-Based Bipolar Graphs Using T-(Co)norms. 777-783 - Ernesto Jiménez-Ruiz, Asan Agibetov, Jiaoyan Chen, Matthias Samwald, Valerie Cross:
Dividing the Ontology Alignment Task with Semantic Embeddings and Logic-Based Modules. 784-791 - Unmesh Joshi, Ceriel J. H. Jacobs, Jacopo Urbani:
Rewrite or Not Rewrite? ML-Based Algorithm Selection for Datalog Query Answering on Knowledge Graphs. 792-799 - Shakil M. Khan, Mikhail Soutchanski:
Necessary and Sufficient Conditions for Actual Root Causes. 800-808 - Kailun Luo, Yongmei Liu, Yves Lespérance, Ziliang Lin:
Agent Abstraction via Forgetting in the Situation Calculus. 809-816 - Tao Luo, Yifan Wei, Mei Yu, Xuewei Li, Mankun Zhao, Tianyi Xu, Jian Yu, Jie Gao, Ruiguo Yu:
BTDE: Block Term Decomposition Embedding for Link Prediction in Knowledge Graph. 817-824 - Munyque Mittelmann, Laurent Perrussel:
Auction Description Language (ADL): General Framework for Representing Auction-Based Markets. 825-832 - Hung Nghiep Tran, Atsuhiro Takasu:
Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion. 833-840 - Andreas Niskanen, Matti Järvisalo:
Strong Refinements for Hard Problems in Argumentation Dynamics. 841-848 - Andreas Niskanen, Matti Järvisalo:
Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach. 849-856 - Francesco Parisi, John Grant:
On Measuring Inconsistency in Relational Databases with Denial Constraints. 857-864 - Nico Potyka:
Abstract Argumentation with Markov Networks. 865-872 - Patrick Rodler:
Reuse, Reduce and Recycle: Optimizing Reiter's HS-Tree for Sequential Diagnosis. 873-880 - Zeynep G. Saribatur, Johannes Peter Wallner, Stefan Woltran:
Explaining Non-Acceptability in Abstract Argumentation. 881-888 - Kai Sauerwald, Gabriele Kern-Isberner, Christoph Beierle:
A Conditional Perspective for Iterated Belief Contraction. 889-896 - Kenneth Skiba, Daniel Neugebauer, Jörg Rothe:
Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. 897-904 - Umberto Straccia:
How Much Knowledge Is in a Knowledge Base? Introducing Knowledge Measures (Preliminary Report). 905-912 - Federico Toffano, Nic Wilson:
Minimality and Comparison of Sets of Multi-Attribute Vectors. 913-920 - Meng Wang, Tongtong Wu, Guilin Qi:
A Hash Learning Framework for Search-Oriented Knowledge Graph Embedding. 921-928 - Mahdieh Abbasi, Changjian Shui, Arezoo Rajabi, Christian Gagné, Rakesh B. Bobba:
Toward Metrics for Differentiating Out-of-Distribution Sets. 929-936 - Adel Abusitta, Esma Aïmeur, Omar Abdel Wahab:
Generative Adversarial Networks for Mitigating Biases in Machine Learning Systems. 937-944 - Alexandre Araujo, Benjamin Négrevergne, Yann Chevaleyre, Jamal Atif:
Understanding and Training Deep Diagonal Circulant Neural Networks. 945-952 - Umar Asif, Jianbin Tang, Stefan Harrer:
Ensemble Knowledge Distillation for Learning Improved and Efficient Networks. 953-960 - Maroua Bahri, Albert Bifet, Silviu Maniu, Rodrigo Fernandes de Mello, Nikolaos Tziortziotis:
Compressed k-Nearest Neighbors Ensembles for Evolving Data Streams. 961-968 - Ali Bakhshi, Aaron S. W. Wong, Stephan K. Chalup:
End-To-End Speech Emotion Recognition Based on Time and Frequency Information Using Deep Neural Networks. 969-975 - Sambaran Bandyopadhyay, Saley Vishal Vivek, M. Narasimha Murty:
Integrating Network Embedding and Community Outlier Detection via Multiclass Graph Description. 976-983 - Kalliopi Basioti, George V. Moustakides, Emmanouil Z. Psarakis:
Maximal Correlation: An Alternative Criterion for Training Generative Networks. 984-991 - Shawn Beaulieu, Lapo Frati, Thomas Miconi, Joel Lehman, Kenneth O. Stanley, Jeff Clune, Nick Cheney:
Learning to Continually Learn. 992-1001 - Amanda Berg, Michael Felsberg, Jörgen Ahlberg:
Unsupervised Adversarial Learning of Anomaly Detection in the Wild. 1002-1008 - Philippe Besnard, Thomas Guyet:
Semantics of Negative Sequential Patterns. 1009-1015 - Ege Beyazit, Yi He, Nian-Feng Tzeng, Xindong Wu:
Online Learning to Accelerate Neural Network Inference with Traveling Classifiers. 1016-1023 - Faustine Bousquet, Sophie Lèbre, Christian Lavergne:
From Mixture of Longitudinal and Non-Gaussian Advertising Data to Click-Through-Rate Prediction. 1024-1030 - John Burden, Daniel Kudenko:
Uniform State Abstraction for Reinforcement Learning. 1031-1038