![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search 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 25 matches
- 2020
- Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták
, Neng-Fa Zhou:
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67: 549-579 (2020) - Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran:
The Impact of Treewidth on Grounding and Solving of Answer Set Programs. J. Artif. Intell. Res. 67: 35-80 (2020) - Michael Cashmore
, Daniele Magazzeni
, Parisa Zehtabi
:
Planning for Hybrid Systems via Satisfiability Modulo Theories. J. Artif. Intell. Res. 67: 235-283 (2020) - Margarita P. Castro
, Chiara Piacentini, André Augusto Ciré, J. Christopher Beck:
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics. J. Artif. Intell. Res. 67: 607-651 (2020) - Maxime Chabert, Christine Solnon:
A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering. J. Artif. Intell. Res. 67: 509-547 (2020) - Alessandro Checco, Jo Bates, Gianluca Demartini
:
Adversarial Attacks on Crowdsourcing Quality Control. J. Artif. Intell. Res. 67: 375-408 (2020) - Hana Chockler
, Pascal Kesseli
, Daniel Kroening, Ofer Strichman:
Learning the Language of Software Errors. J. Artif. Intell. Res. 67: 881-903 (2020) - William W. Cohen, Fan Yang, Kathryn Mazaitis:
TensorLog: A Probabilistic Database Implemented Using Deep-Learning Infrastructure. J. Artif. Intell. Res. 67: 285-325 (2020) - Zack Fitzsimmons, Martin Lackner
:
Incomplete Preferences in Single-Peaked Electorates. J. Artif. Intell. Res. 67: 797-833 (2020) - Daniel Höller
, Pascal Bercher
, Gregor Behnke
, Susanne Biundo:
HTN Planning as Heuristic Progression Search. J. Artif. Intell. Res. 67: 835-880 (2020) - Dieuwke Hupkes, Verna Dankers, Mathijs Mul, Elia Bruni:
Compositionality Decomposed: How do Neural Networks Generalise? J. Artif. Intell. Res. 67: 757-795 (2020) - Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. 67: 705-756 (2020) - Samuel Läubli
, Sheila Castilho
, Graham Neubig, Rico Sennrich, Qinlan Shen, Antonio Toral
:
A Set of Recommendations for Assessing Human-Machine Parity in Language Translation. J. Artif. Intell. Res. 67: 653-672 (2020) - Marco Lippi
, Giuseppe Contissa
, Agnieszka Jablonowska
, Francesca Lagioia
, Hans-Wolfgang Micklitz
, Przemyslaw Palka
, Giovanni Sartor
, Paolo Torroni
:
The Force Awakens: Artificial Intelligence for Consumer Law. J. Artif. Intell. Res. 67: 169-190 (2020) - Lemao Liu, Andrew M. Finch, Masao Utiyama, Eiichiro Sumita:
Agreement on Target-Bidirectional Recurrent Neural Networks for Sequence-to-Sequence Learning. J. Artif. Intell. Res. 67: 581-606 (2020) - Ronald Ortner
:
Regret Bounds for Reinforcement Learning via Markov Chain Concentration. J. Artif. Intell. Res. 67: 115-128 (2020) - Alvaro Perez-Diaz
, Enrico H. Gerding, Frank McGroarty
:
Catching Cheats: Detecting Strategic Manipulation in Distributed Optimisation of Electric Vehicle Aggregators. J. Artif. Intell. Res. 67: 437-470 (2020) - Ramya Ramakrishnan, Ece Kamar, Debadeepta Dey, Eric Horvitz, Julie Shah:
Blind Spot Detection for Safe Sim-to-Real Transfer. J. Artif. Intell. Res. 67: 191-234 (2020) - Nicolás Rivera, Carlos Hernández
, Nicolás Hormazábal, Jorge A. Baier:
The 2k Neighborhoods for Grid Path Planning. J. Artif. Intell. Res. 67: 81-113 (2020) - Mohammad Rostami
, David Isele, Eric Eaton:
Using Task Descriptions in Lifelong Machine Learning for Improved Performance and Zero-Shot Transfer. J. Artif. Intell. Res. 67: 673-704 (2020) - Erel Segal-Halevi, Avinatan Hassidim, Haris Aziz
:
Fair Allocation with Diminishing Differences. J. Artif. Intell. Res. 67: 471-507 (2020) - Jendrik Seipp, Thomas Keller
, Malte Helmert:
Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. 67: 129-167 (2020) - Jesse Thomason, Aishwarya Padmakumar, Jivko Sinapov, Nick Walker, Yuqian Jiang, Harel Yedidsion, Justin W. Hart, Peter Stone, Raymond J. Mooney:
Jointly Improving Parsing and Perception for Natural Language Commands through Human-Robot Dialog. J. Artif. Intell. Res. 67: 327-374 (2020) - Eric Timmons, Brian Charles Williams:
Best-First Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation. J. Artif. Intell. Res. 67: 1-34 (2020) - Romain Wallon
, Stefan Mengel:
Revisiting Graph Width Measures for CNF-Encodings. J. Artif. Intell. Res. 67: 409-436 (2020)
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-03 13:59 CEST 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