default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research (JAIR), Volume 35
Volume 35, May - August 2009
- Yllias Chali, Shafiq R. Joty, Sadid A. Hasan:
Complex Question Answering: Unsupervised Learning Approaches and Experiments. 1-47 - Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert
, Marco Pistore:
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. 49-117 - Sarvapali D. Ramchurn, Claudio Mezzetti, Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Rajdeep K. Dash, Nicholas R. Jennings:
Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty. 119-159 - Vincent Conitzer:
Eliciting Single-Peaked Preferences Using Comparison Queries. 161-191 - Ran El-Yaniv, Dmitry Pechyony:
Transductive Rademacher Complexity and its Applications. 193-234 - Marek Petrik, Shlomo Zilberstein:
A Bilinear Programming Approach for Multiagent Planning. 235-274 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. 275-341 - Roberto Sebastiani, Michele Vescovi:
Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability. 343-389 - Rónán Daly, Qiang Shen:
Learning Bayesian Network Equivalence Classes with Ant Colony Optimization. 391-447 - Facundo Bromberg, Dimitris Margaritis, Vasant G. Honavar:
Efficient Markov Network Structure Discovery Using Independence Tests. 449-484 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? 485-532 - José E. Gallardo, Carlos Cotta, Antonio J. Fernández:
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms. 533-555 - Andreas Krause, Carlos Guestrin:
Optimal Value of Information in Graphical Models. 557-591 - Matthias Zytnicki, Christine Gaspin, Simon de Givry, Thomas Schiex:
Bounds Arc Consistency for Weighted CSPs. 593-621 - Héctor Palacios, Hector Geffner:
Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width. 623-675 - Kaile Su, Abdul Sattar, Guanfeng Lv, Yan Zhang:
Variable Forgetting in Reasoning about Knowledge. 677-716 - Piero A. Bonatti, Carsten Lutz, Frank Wolter:
The Complexity of Circumscription in DLs. 717-773 - Estela Saquete, José Luis Vicedo González, Patricio Martínez-Barco, Rafael Muñoz, Hector Llorens:
Enhancing QA Systems with Complex Temporal Question Processing Capabilities. 775-811 - Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. 813-857
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-16 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
