default search action
Ivan Gavran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
- [b1]Ivan Gavran:
Planning and Specification Problems for Multi-Robot Systems, Powered by Formal Methods. Kaiserslautern University of Technology, Germany, 2022
Journal Articles
- 2020
- [j2]Ivan Gavran, Eva Darulova, Rupak Majumdar:
Interactive synthesis of temporal specifications from examples and natural language. Proc. ACM Program. Lang. 4(OOPSLA): 201:1-201:26 (2020) - 2017
- [j1]Ivan Gavran, Rupak Majumdar, Indranil Saha:
Antlab: A Multi-Robot Task Server. ACM Trans. Embed. Comput. Syst. 16(5s): 190:1-190:19 (2017)
Conference and Workshop Papers
- 2022
- [c10]Jan Corazza, Ivan Gavran, Daniel Neider:
Reinforcement Learning with Stochastic Reward Machines. AAAI 2022: 6429-6436 - 2021
- [c9]Daniel Neider, Jean-Raphaël Gaglione, Ivan Gavran, Ufuk Topcu, Bo Wu, Zhe Xu:
Advice-Guided Reinforcement Learning in a non-Markovian Environment. AAAI 2021: 9073-9080 - [c8]Maximilian Fickert, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml:
Choosing the Initial State for Online Replanning. AAAI 2021: 12311-12319 - [c7]Heiko Becker, Nathaniel Bos, Ivan Gavran, Eva Darulova, Rupak Majumdar:
Lassie: HOL4 tactics by example. CPP 2021: 212-223 - 2020
- [c6]Zhe Xu, Ivan Gavran, Yousef Ahmad, Rupak Majumdar, Daniel Neider, Ufuk Topcu, Bo Wu:
Joint Inference of Reward Machines and Policies for Reinforcement Learning. ICAPS 2020: 590-598 - [c5]Rüdiger Ehlers, Ivan Gavran, Daniel Neider:
Learning Properties in LTL ∩ ACTL from Positive Examples Only. FMCAD 2020: 104-112 - 2018
- [c4]Daniel Neider, Ivan Gavran:
Learning Linear Temporal Properties. FMCAD 2018: 1-10 - [c3]Ivan Gavran, Ortwin Mailahn, Rainer Müller, Richard Peifer, Damien Zufferey:
Tᴏᴏʟ: accessible automated reasoning for human robot collaboration. Onward! 2018: 44-56 - 2017
- [c2]Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani:
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. CONCUR 2017: 13:1-13:17 - 2015
- [c1]Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar, Viktor Vafeiadis:
Rely/Guarantee Reasoning for Asynchronous Programs. CONCUR 2015: 483-496
Informal and Other Publications
- 2021
- [i5]Heiko Becker, Nathaniel Bos, Ivan Gavran, Eva Darulova, Rupak Majumdar:
Lassie: HOL4 Tactics by Example. CoRR abs/2101.00930 (2021) - 2019
- [i4]Zhe Xu, Ivan Gavran, Yousef Ahmad, Rupak Majumdar, Daniel Neider, Ufuk Topcu, Bo Wu:
Joint Inference of Reward Machines and Policies for Reinforcement Learning. CoRR abs/1909.05912 (2019) - 2018
- [i3]Brendon Boldt, Ivan Gavran, Eva Darulova, Rupak Majumdar:
Precise but Natural Specification for Robot Tasks. CoRR abs/1803.02238 (2018) - [i2]Daniel Neider, Ivan Gavran:
Learning Linear Temporal Properties. CoRR abs/1806.03953 (2018) - 2017
- [i1]Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani:
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. CoRR abs/1704.05303 (2017)
Coauthor Index
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.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint