default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th ECAI 2012: Montpellier, France
- Luc De Raedt, Christian Bessiere, Didier Dubois, Patrick Doherty, Paolo Frasconi, Fredrik Heintz, Peter J. F. Lucas:
ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012. Frontiers in Artificial Intelligence and Applications 242, IOS Press 2012, ISBN 978-1-61499-097-0
Keynote Talks
- Wolfram Burgard:
Probabilistic Techniques for Mobile Robot Navigation. 3 - Adnan Darwiche:
Generalized Decision Diagrams: The game is not over yet! 4 - Tom M. Mitchell:
Never Ending Learning. 5 - Michael J. Wooldridge:
Bad equilibria (and what to do about them). 6-11
Frontiers of Artificial Intelligence
- Elizabeth Black
, Anthony Hunter:
Executable Logic for Dialogical Argumentation. 15-20 - Simon Colton, Geraint A. Wiggins:
Computational Creativity: The Final Frontier? 21-26 - Gert de Cooman, Jasper De Bock, Arthur Van Camp:
Recent advances in imprecise-probabilistic graphical models. 27-32 - Kristian Kersting:
Lifted Probabilistic Inference. 33-38 - Pierre-Yves Oudeyer:
Developmental Mechanisms for Autonomous Life-Long Learning in Robots. 39 - Jan Peters, Katharina Mülling, Jens Kober, Duy Nguyen-Tuong, Oliver Krömer:
Robot Skill Learning. 40-45
ECAI Long Papers
- Thomas Ågotnes, Wiebe van der Hoek, Michael J. Wooldridge:
Conservative Social Laws. 49-54 - Jean-Marc Alliot, Nicolas Durand, David Gianazza, Jean-Baptiste Gotteland:
Finding and Proving the Optimum: Cooperative Stochastic and Deterministic Search. 55-60 - Alessandro Artale, Vladislav Ryzhikov, Roman Kontchakov:
DL-Lite with Attributes and Datatypes. 61-66 - Andreas Arzt, Gerhard Widmer, Sebastian Böck, Reinhard Sonnleitner, Harald Frostel:
Towards a Complete Classical Music Companion. 67-72 - Markus Aschinger, Conrad Drescher, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. 73-78 - Hosein Azarbonyad, Azadeh Shakery, Heshaam Faili:
Using Learning to Rank Approach for Parallel Corpora Based Cross Language Information Retrieval. 79-84 - Christer Bäckström, Anders Jonsson, Peter Jonsson:
Macros, Reactive Plans and Compact Representations. 85-90 - Christer Bäckström, Anders Jonsson, Peter Jonsson:
From Macro Plans to Automata Plans. 91-96 - Liviu Badea:
Multirelational Consensus Clustering with Nonnegative Decompositions. 97-102 - Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Riccardo De Masellis, Paolo Felli, Marco Montali:
Verification of Description Logic Knowledge and Action Bases. 103-108 - Hendrik Baier, Mark H. M. Winands:
Nested Monte-Carlo Tree Search for Online Planning in Large MDPs. 109-114 - Gabriele Barbieri, François Pachet, Pierre Roy, Mirko Degli Esposti:
Markov Constraints for Generating Lyrics with Style. 115-120 - Karel Bartos, Martin Rehák:
Trust-based Solution for Robust Self-configuration of Distributed Intrusion Detection Systems. 121-126 - Ringo Baumann:
What Does it Take to Enforce an Argument? Minimal Change in abstract Argumentation. 127-132 - Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia:
The Possible Winner Problem with Uncertain Weights. 133-138 - Daniel Beck, Gerhard Lakemeyer:
Representing Value Functions with Recurrent Binary Decision Diagrams. 139-144 - Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Jean-Charles Régin:
An O(nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. 145-150 - Salem Benferhat, Célia da Costa Pereira, Andrea Tettamanzi:
Hybrid Possibilistic Conditioning for Revision under Weighted Inputs. 151-156 - Salem Benferhat, Karim Tabia:
Three-valued possibilistic networks. 157-162 - Christoph Benzmüller, Jens Otten, Thomas Raths:
Implementing and Evaluating Provers for First-order Modal Logics. 163-168 - Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna Helena Reali Costa:
Heuristically Accelerated Reinforcement Learning: Theoretical and Experimental Results. 169-174 - Yngvi Björnsson:
Learning Rules of Simplified Boardgames by Observing. 175-180 - Mathieu Bonneau, Nathalie Peyrard, Régis Sabbadin:
A Reinforcement-Learning Algorithm for Sampling Design in Markov Random Fields. 181-186 - Grégory Bonnet:
A Protocol Based on a Game-Theoretic Dilemma to Prevent Malicious Coalitions in Reputation Systems. 187-192 - Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek:
Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. 193-198 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Interval Temporal Logics over Finite Linear Orders: the Complete Picture. 199-204 - Elena Cabrio, Serena Villata:
Natural Language Arguments: A Combined Approach. 205-210 - Anaïs Cadilhac, Nicholas Asher, Farah Benamara, Vladimir Popescu, Mohamadou Seck:
Preference Extraction From Negotiation Dialogues. 211-216 - Michael Cashmore, Maria Fox, Enrico Giunchiglia:
Planning as Quantified Boolean Formula. 217-222 - Jesús Cerquides, Pedro Meseguer:
Speeding Up 2-way Number Partitioning. 223-227 - Siqi Chen, Gerhard Weiss:
An Efficient and Adaptive Approach to Negotiation in Complex Environments. 228-233 - Malumbo Chipofya:
Combining DRA and CYC into a Network Friendly Calculus. 234-239 - Lukás Chrpa, Thomas Leo McCluskey:
On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements. 240-245 - Javier Coego, Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
Ideal Point Guided Iterative Deepening. 246-251 - Amanda Jane Coles:
Opportunistic Branched Plans to Maximise Utility in the Presence of Resource Uncertainty. 252-257 - Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi:
A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. 258-263 - Giorgio Corani, Alessandro Antonucci, Rocco De Rosa:
Compression-based AODE Classifiers. 264-269 - Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Bounded Single-Peaked Width and Proportional Representation. 270-275 - William Fernando Correa, Henri Prade, Gilles Richard:
When intelligence is just a matter of copying. 276-281 - Luca Costabello, Serena Villata, Fabien Gandon:
Context-Aware Access Control for RDF Graph Stores. 282-287 - Miguel Couceiro, Didier Dubois, Henri Prade, Tamás Waldhauser:
Decision-making with Sugeno integrals: DMU vs. MCDM. 288-293 - Krzysztof Dembczynski, Willem Waegeman, Eyke Hüllermeier:
An Analysis of Chaining in Multi-Label Classification. 294-299 - Thach-Thao Duong, Duc Nghia Pham, Abdul Sattar:
A Study of Local Minimum Avoidance Heuristics for SAT. 300-305 - Stefan Edelkamp, Peter Kissmann, Álvaro Torralba:
Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction. 306-311 - Patrick Eyerich:
Preferring Properly: Increasing Coverage while Maintaining Quality in Anytime Temporal Planning. 312-317 - Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Weighted Manipulation for Four-Candidate Llull Is Easy. 318-323 - Xiuyi Fan, Francesca Toni:
Agent Strategies for ABA-based Information-seeking and Inquiry Dialogues. 324-329 - Maier Fenster, Inon Zuckerman, Sarit Kraus:
Guiding User Choice During Discussion by Silence, Examples and Justifications. 330-335 - Olivier Ferret:
Combining Bootstrapping and Feature Selection for Improving a Distributional Thesaurus. 336-341 - Yang Gao, Francesca Toni, Robert Craven:
Argumentation-Based Reinforcement Learning for RoboCup Soccer Keepaway. 342-347 - Alfonso Gerevini, Alessandro Saetti, Ivan Serina:
Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval. 348-353 - Mehmet Gönen:
A Bayesian Multiple Kernel Learning Framework for Single and Multiple Output Regression. 354-359 - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate Tradeoffs on Matroids. 360-365 - Gianluigi Greco, Antonella Guzzo, Luigi Pontieri:
Process Discovery via Precedence Constraints. 366-371 - Gianluigi Greco, Enrico Malizia, Francesco Scarcello, Luigi Palopoli:
Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary. 372-377 - Alon Grubshtein, Roie Zivan, Amnon Meisels:
Partial Cooperation in Multi-agent Local Search. 378-383 - António Gusmão, Tapani Raiko:
Towards Generalizing the Success of Monte-Carlo Tree Search beyond the Game of Go. 384-389 - Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz:
Complexity of Branching Temporal Description Logics. 390-395 - Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. 396-401 - Andreas Hertle, Christian Dornhege, Thomas Keller, Bernhard Nebel:
Planning with Semantic Attachments: An Object-Oriented View. 402-407 - Samuel Hiard, Pierre Geurts, Louis Wehenkel:
Comparator selection for RPC with many labels. 408-413 - Greg Hines, Talal Rahwan, Nicholas R. Jennings:
An Anytime Algorithm for Finding the ?-Core in Nontransferable Utility Coalitional Games. 414-419 - Birgit Hofer, Franz Wotawa:
Spectrum Enhanced Dynamic Slicing for better Fault Localization. 420-425 - Jinbo Huang:
SAT vs. Search for Qualitative Temporal Reasoning. 426-431 - Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symmetries in Itemset Mining. 432-437 - Wojciech Jamroga:
Concepts, Agents, and Coalitions in Alternating Time. 438-443 - Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau, Yujiao Zhou, Ian Horrocks:
Large-scale Interactive Ontology Matching: Algorithms and Implementation. 444-449 - Souhila Kaci:
Characterization of Positive and Negative Information in Comparative Preference Representation. 450-455 - Gabriele Kern-Isberner, Matthias Thimm:
A Ranking Semantics for First-Order Conditionals. 456-461 - David Kinny:
A New Approach to the Snake-In-The-Box Problem. 462-467 - Sarit Kraus, Michael J. Wooldridge:
Delegating Decisions in Strategic Settings. 468-473 - Matthias Knorr, Pascal Hitzler, Frederick Maier:
Reconciling OWL and Non-monotonic Rules for the Semantic Web. 474-479 - Lars Kotthoff:
Hybrid Regression-Classification Models for Algorithm Selection. 480-485 - Christophe Labreuche, Nicolas Maudet, Wassila Ouerdane:
Justifying Dominating Options when Preferential Information is Incomplete. 486-491 - Martin Lackner, Andreas Pfandler:
Fixed-Parameter Algorithms for Closed World Reasoning. 492-497 - Gerhard Lakemeyer, Yves Lespérance:
Efficient Reasoning in Multiagent Epistemic Logics. 498-503 - Jérôme Lang, Bruno Zanuttini:
Knowledge-Based Programs as Plans - The Complexity of Plan Verification. 504-509 - Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap:
A Path-Optimal GAC Algorithm for Table Constraints. 510-515 - Maurizio Lenzerini, Domenico Fabio Savo:
Updating inconsistent Description Logic knowledge bases. 516-521 - Julien Lesca, Patrice Perny:
Almost-truthful Mechanisms for Fair Social Choice Functions. 522-527 - Minyi Li, Quoc Bao Vo:
Choosing Combinatorial Social Choice by Heuristic Search. 528-533 - Nan Li, Abraham Schreiber, William W. Cohen, Kenneth R. Koedinger:
Creating Features from a Learned Grammar in a Simulated Student. 534-539 - Nir Lipovetzky, Hector Geffner:
Width and Serialization of Classical Planning Problems. 540-545 - Viliam Lisý, Radek Píbil, Jan Stiborek, Branislav Bosanský, Michal Pechoucek:
Game-theoretic Approach to Adversarial Plan Recognition. 546-551 - Weiming Liu, Sanjiang Li:
Here, There, but Not Everywhere: An Extended Framework for Qualitative Constraint Satisfaction. 552-557 - Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari:
Inconsistency Handling in Datalog+/- Ontologies. 558-563 - Charles Lumet, Sylvain Bouveret, Michel Lemaître:
Fair Division of Indivisible Goods under Risk. 564-569 - Chuan Luo, Kaile Su, Shaowei Cai:
Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking. 570-575 - Samhar Mahmoud, Nathan Griffiths, Jeroen Keppens, Michael Luck:
Efficient Norm Emergence through Experiential Dynamic Punishment. 576-581 - Wolfgang Mayer, Gerhard Friedrich, Markus Stumptner:
On computing correct processes and repairs sing partial behavioral models. 582-587 - Vera Mersheeva, Gerhard Friedrich:
Routing for Continuous Monitoring by Multiple Micro AVs in Disaster Scenarios. 588-593 - Roberto Micalizio, Gianluca Torta:
Diagnosing Delays in Multi-Agent Plans Execution. 594-599 - Tanvi S. Motwani, Raymond J. Mooney:
Improving Video Activity Recognition using Object Recognition and Text Mining. 600-605 - Felix Müller, Christian Späth, Thomas Geier, Susanne Biundo:
Exploiting Expert Knowledge in Factored POMDPs. 606-611 - Nina Narodytska, Toby Walsh, Lirong Xia:
Combining Voting Rules Together. 612-617 - Nadeschda Nikitina, Sebastian Rudolph:
ExpExpExplosion: Uniform Interpolation in General EL Terminologies. 618-623 - Raz Nissim, Udi Apsel, Ronen I. Brafman:
Tunneling and Decomposition-Based State Reduction for Optimal Planning. 624-629 - Lhouari Nourine, Jean-Marc Petit:
Extending Set-based Dualization: Application to Pattern Mining. 630-635 - Özgür L. Özçep, Rolf Grütter, Ralf Möller:
Nearness Rules and Scaled Proximity. 636-641 - Antonio Penta, Gianluca Quercini, Chantal Reynaud, Nigel Shadbolt:
Discovering Cross-language Links in Wikipedia through Semantic Relatedness. 642-647 - Ingo Pill, Thomas Quaritsch:
Optimizations for the Boolean Approach to Computing Minimal Hitting Sets. 648-653 - Gianvito Pio, Michelangelo Ceci, Corrado Loglisci, Domenica D'Elia, Donato Malerba:
Hierarchical and Overlapping Co-Clustering of mRNA: miRNA Interactions. 654-659 - James Pita, Richard John, Rajiv T. Maheswaran, Milind Tambe, Sarit Kraus:
A Robust Approach to Addressing Human Adversaries in Security Games. 660-665 - Marco Ragni, Stefanie Neubert:
Solving Raven's IQ-tests: An AI and Cognitive Modeling Approach. 666-671 - Reyhaneh Reyhani, Mark C. Wilson:
Best Reply Dynamics for Scoring Rules. 672-677 - Jussi Rintanen:
Complexity of Conditional Planning under Partial Observability and Infinite Executions. 678-683 - Jussi Rintanen:
Engineering Efficient Planners with SAT. 684-689 - Igor Rochlin, David Sarne, Moshe Laifenfeld:
Coordinated Exploration with a Shared Goal in Costly Environments. 690-695 - Ji Ruan, Michael Thielscher:
Strategic and Epistemic Reasoning for the Game Description Language GDL-II. 696-701 - Salvatore Ruggieri:
Deciding Membership in a Class of Polyhedra. 702-707 - Abdallah Saffidine, Tristan Cazenave:
Multiple-Outcome Proof Number Search. 708-713