( en | de | ru )

 

Disambiguation of "Heinemann, Bernhard"

Author of the publication

copydeleteadd this publication to your clipboard
Reusing Topological Nexttime Logic.

. Stud Logica, 108 (6): 1207-1234 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bernhard Heinemann

Bernhard Heinemann

Bernhard Heinemann

Bernhard Heinemann

Bernhard Heinemann

 

Other publications of authors with the same name

The Topological Effect of Improving Knowledge Acquisition.. MICAI, volume 3789 of Lecture Notes in Computer Science, page 21-30. Springer, (2005)Subset Spaces Modeling Knowledge-Competitive Agents.. KSEM, volume 9403 of Lecture Notes in Computer Science, page 3-14. Springer, (2015)Separating Sets by Modal Formulas.. AMAST, volume 1548 of Lecture Notes in Computer Science, page 140-153. Springer, (1998)Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay., , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 81-93. Springer, (2014)Linear Tense Logics of Increasing Sets.. J. Log. Comput., 12 (4): 583-606 (2002)Reasoning About Operations on Sets.. Canadian AI, volume 4509 of Lecture Notes in Computer Science, page 308-319. Springer, (2007)A Hybrid Treatment of Evolutionary Sets.. MICAI, volume 2313 of Lecture Notes in Computer Science, page 204-213. Springer, (2002)Refining the Notion of Effort.. ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, page 1071-1072. IOS Press, (2010)On Binary Computation Structures.. Math. Log. Q., (1997)On Expressive Completeness of Modal Logic.. LFCS, volume 813 of Lecture Notes in Computer Science, page 153-163. Springer, (1994)