default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Heinemann
Person information
- affiliation: University of Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Bernhard Heinemann
:
Reusing Topological Nexttime Logic. Stud Logica 108(6): 1207-1234 (2020)
2010 – 2019
- 2019
- [j12]Bernhard Heinemann:
Topological facets of the logic of subset spaces (with emphasis on canonical models). J. Log. Comput. 29(7): 1099-1120 (2019) - 2016
- [c43]Bernhard Heinemann:
A Subset Space Perspective on Agents Cooperating for Knowledge. KSEM 2016: 503-514 - [c42]Bernhard Heinemann:
Augmenting Subset Spaces to Cope with Multi-agent Knowledge. LFCS 2016: 130-145 - 2015
- [c41]Bernhard Heinemann:
Subset Spaces Modeling Knowledge-Competitive Agents. KSEM 2015: 3-14 - [c40]Bernhard Heinemann:
On Topologically Relevant Fragments of the Logic of Linear Flows of Time. WoLLIC 2015: 27-37 - 2014
- [c39]Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93 - [c38]Bernhard Heinemann:
Coming Upon the Classic Notion of Implicit Knowledge Again. KSEM 2014: 1-12 - 2013
- [c37]Bernhard Heinemann:
Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference. LFCS 2013: 219-233 - [c36]Bernhard Heinemann:
Characterizing Subset Spaces as Bi-topological Structures. LPAR 2013: 373-388 - 2012
- [c35]Bernhard Heinemann:
Characterizing Certain Topological Specifications. CSR 2012: 184-195 - 2010
- [j11]Bernhard Heinemann:
Logics for multi-subset spaces. J. Appl. Non Class. Logics 20(3): 219-240 (2010) - [j10]Bernhard Heinemann:
Using Hybrid Logic for Coping with Functions in Subset Spaces. Stud Logica 94(1): 23-45 (2010) - [c34]Bernhard Heinemann:
The Cantor Space as a Generic Model of Topologically Presented Knowledge. CSR 2010: 169-180 - [c33]Bernhard Heinemann:
Refining the Notion of Effort. ECAI 2010: 1071-1072
2000 – 2009
- 2009
- [c32]Bernhard Heinemann:
Observational Effort and Formally Open Mappings. WoLLIC 2009: 197-208 - 2008
- [j9]Bernhard Heinemann:
A Hybrid Logic for Reasoning about Knowledge and Topology. J. Log. Lang. Inf. 17(1): 19-41 (2008) - [c31]Bernhard Heinemann:
Modelling Uniformity and Control during Knowledge Acquisition. FLAIRS 2008: 65-70 - [c30]Bernhard Heinemann:
Topology and Knowledge of Multiple Agents. IBERAMIA 2008: 1-10 - [c29]Bernhard Heinemann:
Regarding Overlapping as a Basic Concept of Subset Spaces. TIME 2008: 41-45 - 2007
- [c28]Bernhard Heinemann:
Reasoning About Operations on Sets. Canadian AI 2007: 308-319 - [c27]Bernhard Heinemann:
A PDL-Like Logic of Knowledge Acquisition. CSR 2007: 146-157 - [c26]Bernhard Heinemann:
Some Spatial and Spatio-Temporal Operators Derived from the Topological View of Knowledge. FLAIRS 2007: 659-664 - [c25]Bernhard Heinemann:
Including the Past in 'Topologic'. LFCS 2007: 269-283 - 2006
- [c24]Bernhard Heinemann:
Regarding Overlaps in 'Topologic'. Advances in Modal Logic 2006: 259-277 - [c23]Bernhard Heinemann:
Reasoning about Knowledge and Continuity. FLAIRS 2006: 37-42 - 2005
- [c22]Bernhard Heinemann:
A Spatio-Temporal View of Knowledge. FLAIRS 2005: 703-708 - [c21]Bernhard Heinemann:
Algebras as Knowledge Structures. MFCS 2005: 471-482 - [c20]Bernhard Heinemann:
The Topological Effect of Improving Knowledge Acquisition. MICAI 2005: 21-30 - 2004
- [j8]Bernhard Heinemann:
The Hybrid Logic of Linear Set Spaces. Log. J. IGPL 12(3): 181-198 (2004) - [j7]Bernhard Heinemann:
A Modal Logic for Discretely Descending Chains of Sets. Stud Logica 76(1): 67-90 (2004) - [c19]Bernhard Heinemann:
A Two sorted Hybrid Logic Including Guarded Jumps. Advances in Modal Logic 2004: 73-92 - [c18]Bernhard Heinemann:
A Hybrid Logic of Knowledge Supporting Topological Reasoning. AMAST 2004: 181-195 - 2003
- [c17]Bernhard Heinemann:
Extended Canonicity of Certain Topological Properties of Set Spaces. LPAR 2003: 137-151 - [c16]Bernhard Heinemann:
An Application of Monodic First Order Temporal Logic to Reasoning about Knowledge. TIME 2003: 10-16 - 2002
- [j6]Bernhard Heinemann:
Linear Tense Logics of Increasing Sets. J. Log. Comput. 12(4): 583-606 (2002) - [c15]Bernhard Heinemann:
Towards Uniform Reasoning via Structured Subset Spaces. Advances in Modal Logic 2002: 185-204 - [c14]Bernhard Heinemann:
Knowledge over Dense Flows of Time (from a Hybrid Point of View). FSTTCS 2002: 194-205 - [c13]Bernhard Heinemann:
A Hybrid Treatment of Evolutionary Sets. MICAI 2002: 204-213 - 2001
- [c12]Bernhard Heinemann:
Modelling Change with the Aid of Knowledge and Time. FCT 2001: 150-161 - [c11]Bernhard Heinemann:
About the Temporal Decrease of Sets. TIME 2001: 234-239 - 2000
- [c10]Bernhard Heinemann:
Generalizing the Modal and Temporal Logic of Linear Time. AMAST 2000: 41-56 - [c9]Bernhard Heinemann:
Extending Topological Nexttime Logic. TIME 2000: 87-94
1990 – 1999
- 1999
- [j5]Bernhard Heinemann:
The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees. Fundam. Informaticae 39(3): 259-272 (1999) - [j4]Bernhard Heinemann:
Temporal Aspects of the Modal Logic of Subset Spaces. Theor. Comput. Sci. 224(1-2): 135-155 (1999) - [c8]Bernhard Heinemann:
On Sets Growing Continously. FSTTCS 1999: 420-431 - 1998
- [j3]Bernhard Heinemann:
Topological Modal Logics Satisfying Finite Chain Conditions. Notre Dame J. Formal Log. 39(3): 406-421 (1998) - [c7]Bernhard Heinemann:
Separating Sets by Modal Formulas. AMAST 1998: 140-153 - 1997
- [j2]Bernhard Heinemann:
On Binary Computation Structures. Math. Log. Q. 43: 203-215 (1997) - [c6]Bernhard Heinemann:
A Modal Logic for Reasoning about Knowledge and Time on Binary Subset Trees. ECSQARU-FAPR 1997: 298-310 - [c5]Bernhard Heinemann:
On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces. LFCS 1997: 145-155 - [c4]Bernhard Heinemann:
A Topological Generalization of Propositional Linear Time Temporal Logic. MFCS 1997: 289-297 - [c3]Bernhard Heinemann:
Revisiting Knowledge and Time from a Topological Point of View. SCAI 1997: 40-51 - 1996
- [j1]Bernhard Heinemann:
Expressive Completeness of Modal Logic on Binary Ramified Frames. J. Appl. Non Class. Logics 6(4): 347-367 (1996) - [c2]Bernhard Heinemann:
Topological Nexttime Logic. Advances in Modal Logic 1996: 99-112 - 1994
- [c1]Bernhard Heinemann:
On Expressive Completeness of Modal Logic. LFCS 1994: 153-163 - 1991
- [b1]Bernhard Heinemann, Klaus Weihrauch:
Logik für Informatiker - eine Einführung. Leitfäden und Monographien der Informatik, Teubner 1991, ISBN 978-3-519-02248-0, pp. I-VIII, 1-239
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:00 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:
