default search action
Peter Kissmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j3]Álvaro Torralba
, Vidal Alcázar, Peter Kissmann, Stefan Edelkamp
Efficient symbolic search for cost-optimal planning. Artif. Intell. 242: 52-79 (2017) - 2015
- [c26]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
BDDs Strike Back (in AI Planning). AAAI 2015: 4320-4321 - [c25]Álvaro Torralba
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink. SOCS 2015: 122-130 - 2014
- [j2]Peter Kissmann, Jörg Hoffmann:
BDD Ordering Heuristics for Classical Planning. J. Artif. Intell. Res. 51: 779-804 (2014) - [c24]Stefan Edelkamp, Peter Kissmann, Martha Rohte:
Symbolic and Explicit Search Hybrid through Perfect Hash Functions - A Case Study in Connect Four. ICAPS 2014 - [c23]Jörg Hoffmann, Peter Kissmann, Álvaro Torralba
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. ECAI 2014: 441-446 - 2013
- [c22]Peter Kissmann, Jörg Hoffmann:
What's in It for My BDD? On Causal Graphs and Variable Orders in Planning. ICAPS 2013 - [c21]Álvaro Torralba
Transition Trees for Cost-Optimal Symbolic Planning. ICAPS 2013 - [c20]Thorsten Rauber, Peter Kissmann, Jörg Hoffmann:
Translating Single-Player GDL into PDDL. KI 2013: 188-199 - 2012
- [b1]Peter Kissmann:
Symbolic Search in Planning and General Game Playing (Symbolische Suche in der Handlungsplanung und im Allgemeinen Spiel). Bremen University, Germany, 2012 - [c19]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction. ECAI 2012: 306-311 - [c18]Stefan Edelkamp, Tim Federholzner, Peter Kissmann:
Searching with Partial Belief States in General Games with Incomplete Information. KI 2012: 25-36 - [c17]Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
Lex-Partitioning: A New Option for BDD Search. GRAPHITE 2012: 66-82 - 2011
- [j1]Peter Kissmann, Stefan Edelkamp:
Gamer, a General Game Playing Agent. Künstliche Intell. 25(1): 49-52 (2011) - [c16]Stefan Edelkamp, Peter Kissmann:
On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. AAAI 2011: 18-23 - [c15]Peter Kissmann, Stefan Edelkamp:
Improving Cost-Optimal Domain-Independent Symbolic Planning. AAAI 2011: 992-997 - [c14]Damian Sulewski, Stefan Edelkamp, Peter Kissmann:
Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU. ICAPS 2011 - 2010
- [c13]Peter Kissmann, Stefan Edelkamp:
Instantiating General Games Using Prolog or Dependency Graphs. KI 2010: 255-262 - [c12]Stefan Edelkamp, Peter Kissmann, Damian Sulewski, Hartmut Messerschmidt:
Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search. MKWI 2010: 2295-2308 - [c11]Peter Kissmann, Stefan Edelkamp:
Layer-Abstraction for Symbolically Solving General Two-Player Games. SOCS 2010: 63-70
2000 – 2009
- 2009
- [c10]Stefan Edelkamp, Peter Kissmann:
Optimal Symbolic Planning with Action Costs and Preferences. IJCAI 2009: 1690-1695 - [c9]Peter Kissmann, Stefan Edelkamp:
Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game. KI 2009: 1-8 - 2008
- [c8]Stefan Edelkamp, Peter Kissmann:
Limits and Possibilities of BDDs in State Space Search. AAAI 2008: 1452-1453 - [c7]Peter Kissmann, Stefan Edelkamp:
Symbolic Classification of General Multi-Player Games. ECAI 2008: 905-906 - [c6]Stefan Edelkamp, Peter Kissmann:
Limits and Possibilities of BDDs in State Space Search. KI 2008: 46-53 - [c5]Stefan Edelkamp, Peter Kissmann:
Symbolic Classification of General Two-Player Games. KI 2008: 185-192 - [c4]Stefan Edelkamp, Peter Kissmann:
Partial Symbolic Pattern Databases for Optimal Sequential Planning. KI 2008: 193-200 - [c3]Marco Bakera, Stefan Edelkamp, Peter Kissmann, Clemens D. Renner:
Solving µ-Calculus Parity Games by Symbolic Planning. MoChArt 2008: 15-33 - [c2]Stefan Edelkamp, Shahid Jabbar, Peter Kissmann:
Scaling Search with Pattern Databases. MoChArt 2008: 49-64 - 2007
- [c1]Stefan Edelkamp, Peter Kissmann:
Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs. KI 2007: 444-447
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-25 05:46 CEST 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: