default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2011
- Noa Agmon, Gal A. Kaminka, Sarit Kraus:
Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent. J. Artif. Intell. Res. 42: 887-916 (2011) - Mario Alviano
, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri:
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. J. Artif. Intell. Res. 42: 487-527 (2011) - Enrique Amigó, Julio Gonzalo, Javier Artiles, Felisa Verdejo:
Combining Evaluation Metrics via the Unanimous Improvement Ratio and its Application to Clustering Tasks. J. Artif. Intell. Res. 42: 689-718 (2011) - Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs. J. Artif. Intell. Res. 42: 719-764 (2011) - Richard Booth, Thomas Andreas Meyer, Ivan Varzinczak, Renata Wassermann:
On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic. J. Artif. Intell. Res. 42: 31-53 (2011) - Patrick R. Conrad, Brian Charles Williams:
Drake: An Efficient Executive for Temporal Plans with Choice. J. Artif. Intell. Res. 42: 607-659 (2011) - Peng Dai, Mausam, Daniel S. Weld, Judy Goldsmith:
Topological Value Iteration Algorithms. J. Artif. Intell. Res. 42: 181-209 (2011) - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. 42: 529-573 (2011) - Dov M. Gabbay, David Pearce, Agustín Valverde:
Interpolable Formulas in Equilibrium Logic and Answer Set Programming. J. Artif. Intell. Res. 42: 917-943 (2011) - Matthew L. Ginsberg:
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. J. Artif. Intell. Res. 42: 851-886 (2011) - Daniel Golovin, Andreas Krause:
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. J. Artif. Intell. Res. 42: 427-486 (2011) - Peter D. Grünwald, Joseph Y. Halpern:
Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration. J. Artif. Intell. Res. 42: 393-426 (2011) - Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. 42: 91-124 (2011) - Joohyung Lee, Yunsong Meng:
First-Order Stable Model Semantics and First-Order Loop Formulas. J. Artif. Intell. Res. 42: 125-180 (2011) - José M. Peña:
Finding Consensus Bayesian Network Structures. J. Artif. Intell. Res. 42: 661-687 (2011) - Marc J. V. Ponsen, Steven de Jong, Marc Lanctot:
Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling. J. Artif. Intell. Res. 42: 575-605 (2011) - Ricardo Ribeiro, David Martins de Matos:
Centrality-as-Relevance: Support Sets and Similarity as Geometric Proximity. J. Artif. Intell. Res. 42: 275-308 (2011) - Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar:
Representing and Reasoning with Qualitative Preferences for Compositional Systems. J. Artif. Intell. Res. 42: 211-274 (2011) - Erik Talvitie, Satinder Singh:
Learning to Make Predictions In Partially Observable Environments Without a Generative Model. J. Artif. Intell. Res. 42: 353-392 (2011) - Perukrishnen Vytelingum, Thomas Voice, Sarvapali D. Ramchurn, Alex Rogers, Nicholas R. Jennings:
Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid. J. Artif. Intell. Res. 42: 765-813 (2011) - Toby Walsh:
Where Are the Hard Manipulation Problems? J. Artif. Intell. Res. 42: 1-29 (2011) - Ko-Hsin Cindy Wang, Adi Botea:
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. J. Artif. Intell. Res. 42: 55-90 (2011) - Jia-Hong Wu, Rajesh Kalyanam, Robert Givan:
Stochastic Enforced Hill-Climbing. J. Artif. Intell. Res. 42: 815-850 (2011) - Changhe Yuan, Heejin Lim, Tsai-Ching Lu:
Most Relevant Explanation in Bayesian Networks. J. Artif. Intell. Res. 42: 309-352 (2011)
loading more results 
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-28 14:40 CET from data curated 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:
