Henning Christiansen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Henning Christiansen has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Maja Hanne Kirkeby
Roskilde University, Roskilde, Denmark
7 shared publications - Christian Theil Have
Novo Nordisk Foundation Center for Basic Metabolic Research, Faculty of Health and Medical Sciences, University of Copenhagen, Copenhagen, Denmark
3 shared publications - Masoumeh Vahedi
Department of People and Technology, Roskilde University, Roskilde, Denmark
2 shared publications - Matthieu Petit
Research group PLIS: Programming Logic and Intelligent Systems Department of Communication, Business and Information Technologies Roskilde University P.O.Box 260 DK-4000 Roskilde Denmark
2 shared publications Ole Torp Lassen
Research group PLIS: Programming Logic and Intelligent Systems Department of Communication, Business and Information Technologies Roskilde University P.O.Box 260 DK-4000 Roskilde Denmark
2 shared publications- Troels Andreasen
Roskilde University
2 shared publications
Latest Publications
- 27 December 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 64 (1) , 265-287
$\text {SPL}^{index}$: A spatial polygon learned index (extended version)- 27 December 2025
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 64 (1) , 265-287
$\text {SPL}^{index}$: A spatial polygon learned index (extended version)- 17 June 2024
- Published by Springer Nature
- p. 271-281
$\text {SPL}^{{index}}$: A Spatial Polygon Learned Index- 17 June 2024
- Published by Springer Nature
- p. 271-281
$\text {SPL}^{{index}}$: A Spatial Polygon Learned Index- Open Access
- 18 December 2020
- Published by European Alliance for Innovation n.o. in EAI Endorsed Transactions on Creative Technologies
- Vol. 7 (25)
Robots on stage
- 18 December 2020
- Published by European Alliance for Innovation n.o. in EAI Endorsed Transactions on Creative Technologies
- Vol. 7 (25)
Open AccessRobots on stage
- 17 September 2020
- Published by Springer Nature
- p. 440-447
Efficient and Precise Classification of CT Scannings of Renal Tumors Using Convolutional Neural Networks
- 17 September 2020
- Published by Springer Nature
- p. 440-447
Efficient and Precise Classification of CT Scannings of Renal Tumors Using Convolutional Neural Networks
- 16 March 2019
- Published by Springer Nature
- p. 112-130
Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs
- 16 March 2019
- Published by Springer Nature
- p. 112-130
Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs
- 23 February 2019
- Published by Springer Nature
- p. 94-111
Confluence of CHR Revisited: Invariants and Modulo Equivalence
- 23 February 2019
- Published by Springer Nature
- p. 94-111
Confluence of CHR Revisited: Invariants and Modulo Equivalence
- Open Access
Confluence of CHR revisited: invariants and modulo equivalence
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint Handling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.
Open AccessConfluence of CHR revisited: invariants and modulo equivalence
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint Handling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.
- Open Access
Towards a constraint solver for proving confluence with invariant and equivalence of realistic CHR programs
Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence of terminating programs. While earlier approaches to confluence for CHR programs concern an idealized logic subset, we refer to a semantics compatible with standard Prolog-based implementations. We specify a meta-level constraint language in which invariants and equivalences can be expressed and manipulated, extending our previous theoretical results towards a practical implementation.
Open AccessTowards a constraint solver for proving confluence with invariant and equivalence of realistic CHR programs
Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence of terminating programs. While earlier approaches to confluence for CHR programs concern an idealized logic subset, we refer to a semantics compatible with standard Prolog-based implementations. We specify a meta-level constraint language in which invariants and equivalences can be expressed and manipulated, extending our previous theoretical results towards a practical implementation.
- Open Access
A simple script language for choreography of multiple, synchronizing non-anthropomorphic robots
The scripting language described in this document is (in the first place) intended to be used on robots developed by Anja M{\o}lle Lindelof and Henning Christiansen as part of a research project about robots performing on stage. The target robots are expected to appear as familiar domestic objects that take their own life, so to speak, and perhaps perform together with human players, creating at illusion of a communication between them. In the current version, these robots' common behaviour is determined uniquely by a script written in the language described here -- the only possible autonomy for the robots is action to correct dynamically for inaccuracies that arise during a performance. The present work is preliminary and has not been compared to properly to other research work in this area, and the testing is still limited. A first implementation on small Lego Mindstorms based robots is under development by Mads Saustrup Fox as part of his master thesis work.
Open AccessA simple script language for choreography of multiple, synchronizing non-anthropomorphic robots
The scripting language described in this document is (in the first place) intended to be used on robots developed by Anja M{\o}lle Lindelof and Henning Christiansen as part of a research project about robots performing on stage. The target robots are expected to appear as familiar domestic objects that take their own life, so to speak, and perhaps perform together with human players, creating at illusion of a communication between them. In the current version, these robots' common behaviour is determined uniquely by a script written in the language described here -- the only possible autonomy for the robots is action to correct dynamically for inaccuracies that arise during a performance. The present work is preliminary and has not been compared to properly to other research work in this area, and the testing is still limited. A first implementation on small Lego Mindstorms based robots is under development by Mads Saustrup Fox as part of his master thesis work.
- Open Access
- 3 October 2017
- Published by European Alliance for Innovation n.o. in EAI Endorsed Transactions on Creative Technologies
- Vol. 4 (12)
Interactive Installations for Spatial Access to Artistic Sketchbooks
- 3 October 2017
- Published by European Alliance for Innovation n.o. in EAI Endorsed Transactions on Creative Technologies
- Vol. 4 (12)
Open AccessInteractive Installations for Spatial Access to Artistic Sketchbooks