default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Lohmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j5]Johannes Ebbing, Lauri Hella
, Peter Lohmann, Jonni Virtema:
Boolean dependence logic and partially-ordered connectives. J. Comput. Syst. Sci. 88: 103-125 (2017)- 2014
- [j4]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable dependence logic and IF-logic. Inf. Comput. 239: 237-253 (2014) - [i6]Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema:
Boolean Dependence Logic and Partially-Ordered Connectives. CoRR abs/1406.7132 (2014) - 2013
- [j3]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Stud Logica 101(2): 343-366 (2013) - [c7]Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema:
Boolean Dependence Logic and Partially-Ordered Connectives. WoLLIC 2013: 111-125 - 2012
- [j2]Christian Schuster, Iftikhar Ali, Peter Lohmann, Annett Frick, Michael Förster, Birgit Kleinschmit:
Correction on "Towards Detecting Swath Events in TerraSAR-X Time Series to Establish NATURA 2000 Grassland Habitat Swath Management as Monitoring Parameter". Remote. Sens. 4(8): 2455-2456 (2012) - [c6]Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. SOFSEM 2012: 226-237 - [i5]Peter Lohmann:
Computational Aspects of Dependence Logic. CoRR abs/1206.4564 (2012) - 2011
- [j1]Christian Schuster, Iftikhar Ali, Peter Lohmann, Annett Frick, Michael Förster, Birgit Kleinschmit:
Towards Detecting Swath Events in TerraSAR-X Time Series to Establish NATURA 2000 Grassland Habitat Swath Management as Monitoring Parameter. Remote. Sens. 3(7): 1308-1322 (2011) - [c5]Michael Köster, Peter Lohmann:
Abstraction for model checking modular interpreted systems over ATL. AAMAS 2011: 1129-1130 - [c4]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of Two-Variable Dependence Logic and IF-Logic. LICS 2011: 289-298 - [c3]Michael Köster, Peter Lohmann:
Abstraction for Model Checking Modular Interpreted Systems over ATL. ProMAS 2011: 95-113 - [c2]Johannes Ebbing, Peter Lohmann, Fan Yang:
Model Checking for Modal Intuitionistic Dependence Logic. TbiLLC 2011: 231-256 - [i4]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CoRR abs/1104.0607 (2011) - [i3]Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. CoRR abs/1104.1034 (2011) - [i2]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable Dependence Logic and IF-Logic. CoRR abs/1104.3148 (2011) - 2010
- [c1]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CSL 2010: 411-425 - [i1]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games 2010
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-05-08 21: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
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:
