The SCEAS System
| |||||||

## Search the dblp DataBase
Bernhard Heinemann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Bernhard Heinemann
**Towards Uniform Reasoning via Structured Subset Spaces.**[Citation Graph (0, 0)][DBLP] Advances in Modal Logic, 2002, pp:185-204 [Conf] - Bernhard Heinemann
**A Two sorted Hybrid Logic Including Guarded Jumps.**[Citation Graph (0, 0)][DBLP] Advances in Modal Logic, 2004, pp:73-92 [Conf] - Bernhard Heinemann
**Regarding Overlaps in 'Topologic'.**[Citation Graph (0, 0)][DBLP] Advances in Modal Logic, 2006, pp:259-277 [Conf] - Bernhard Heinemann
**Generalizing the Modal and Temporal Logic of Linear Time.**[Citation Graph (0, 0)][DBLP] AMAST, 2000, pp:41-56 [Conf] - Bernhard Heinemann
**A Hybrid Logic of Knowledge Supporting Topological Reasoning.**[Citation Graph (0, 0)][DBLP] AMAST, 2004, pp:181-195 [Conf] - Bernhard Heinemann
**Separating Sets by Modal Formulas.**[Citation Graph (0, 0)][DBLP] AMAST, 1998, pp:140-153 [Conf] - Bernhard Heinemann
**A Modal Logic for Reasoning about Knowledge and Time on Binary Subset Trees.**[Citation Graph (0, 0)][DBLP] ECSQARU-FAPR, 1997, pp:298-310 [Conf] - Bernhard Heinemann
**Modelling Change with the Aid of Knowledge and Time.**[Citation Graph (0, 0)][DBLP] FCT, 2001, pp:150-161 [Conf] - Bernhard Heinemann
**A Spatio-Temporal View of Knowledge.**[Citation Graph (0, 0)][DBLP] FLAIRS Conference, 2005, pp:703-708 [Conf] - Bernhard Heinemann
**Reasoning about Knowledge and Continuity.**[Citation Graph (0, 0)][DBLP] FLAIRS Conference, 2006, pp:37-42 [Conf] - Bernhard Heinemann
**Knowledge over Dense Flows of Time (from a Hybrid Point of View).**[Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:194-205 [Conf] - Bernhard Heinemann
**On Sets Growing Continously.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1999, pp:420-431 [Conf] - Bernhard Heinemann
**On Expressive Completeness of Modal Logic.**[Citation Graph (0, 0)][DBLP] LFCS, 1994, pp:153-163 [Conf] - Bernhard Heinemann
**On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces.**[Citation Graph (0, 0)][DBLP] LFCS, 1997, pp:145-155 [Conf] - Bernhard Heinemann
**Extended Canonicity of Certain Topological Properties of Set Spaces.**[Citation Graph (0, 0)][DBLP] LPAR, 2003, pp:137-151 [Conf] - Bernhard Heinemann
**Algebras as Knowledge Structures.**[Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:471-482 [Conf] - Bernhard Heinemann
**A Topological Generalization of Propositional Linear Time Temporal Logic.**[Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:289-297 [Conf] - Bernhard Heinemann
**A Hybrid Treatment of Evolutionary Sets.**[Citation Graph (0, 0)][DBLP] MICAI, 2002, pp:204-213 [Conf] - Bernhard Heinemann
**The Topological Effect of Improving Knowledge Acquisition.**[Citation Graph (0, 0)][DBLP] MICAI, 2005, pp:21-30 [Conf] - Bernhard Heinemann
**Revisiting Knowledge and Time from a Topological Point of View.**[Citation Graph (0, 0)][DBLP] SCAI, 1997, pp:40-51 [Conf] - Bernhard Heinemann
**Extending Topological Nexttime Logic.**[Citation Graph (0, 0)][DBLP] TIME, 2000, pp:87-94 [Conf] - Bernhard Heinemann
**About the Temporal Decrease of Sets.**[Citation Graph (0, 0)][DBLP] TIME, 2001, pp:234-239 [Conf] - Bernhard Heinemann
**An Application of Monodic First Order Temporal Logic to Reasoning about Knowledge.**[Citation Graph (0, 0)][DBLP] TIME, 2003, pp:10-16 [Conf] - Bernhard Heinemann
**The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees.**[Citation Graph (0, 0)][DBLP] Fundam. Inform., 1999, v:39, n:3, pp:259-272 [Journal] - Bernhard Heinemann
**The Hybrid Logic of Linear Set Spaces.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2004, v:12, n:3, pp:181-198 [Journal] - Bernhard Heinemann
**Expressive Completeness of Modal Logic on Binary Ramified Frames.**[Citation Graph (0, 0)][DBLP] Journal of Applied Non-Classical Logics, 1996, v:6, n:4, pp:- [Journal] - Bernhard Heinemann
**Linear Tense Logics of Increasing Sets.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2002, v:12, n:4, pp:583-606 [Journal] - Bernhard Heinemann
**On Binary Computation Structures.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 1997, v:43, n:, pp:203-215 [Journal] - Bernhard Heinemann
**Topological Modal Logics Satisfying Finite Chain Conditions.**[Citation Graph (0, 0)][DBLP] Notre Dame Journal of Formal Logic, 1998, v:39, n:3, pp:406-421 [Journal] - Bernhard Heinemann
**A Modal Logic for Discretely Descending Chains of Sets.**[Citation Graph (0, 0)][DBLP] Studia Logica, 2004, v:76, n:1, pp:67-90 [Journal] - Bernhard Heinemann
**Temporal Aspects of the Modal Logic of Subset Spaces.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:224, n:1-2, pp:135-155 [Journal] - Bernhard Heinemann
**Reasoning About Operations on Sets.**[Citation Graph (0, 0)][DBLP] Canadian Conference on AI, 2007, pp:308-319 [Conf] - Bernhard Heinemann
**A PDL-Like Logic of Knowledge Acquisition.**[Citation Graph (0, 0)][DBLP] CSR, 2007, pp:146-157 [Conf] - Bernhard Heinemann
**Some Spatial and Spatio-Temporal Operators Derived from the Topological View of Knowledge.**[Citation Graph (0, 0)][DBLP] FLAIRS Conference, 2007, pp:659-664 [Conf] - Bernhard Heinemann
**Including the Past in 'Topologic'.**[Citation Graph (0, 0)][DBLP] LFCS, 2007, pp:269-283 [Conf] **The Cantor Space as a Generic Model of Topologically Presented Knowledge.**[Citation Graph (, )][DBLP]**Refining the Notion of Effort.**[Citation Graph (, )][DBLP]**Modelling Uniformity and Control during Knowledge Acquisition.**[Citation Graph (, )][DBLP]**Topology and Knowledge of Multiple Agents.**[Citation Graph (, )][DBLP]**Regarding Overlapping as a Basic Concept of Subset Spaces.**[Citation Graph (, )][DBLP]**Observational Effort and Formally Open Mappings.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |