pith. sign in

arxiv: 2509.03318 · v2 · submitted 2025-09-03 · 💻 cs.PL · cs.LO

Semantically Reflected Programs

Eduard Kamburjan , Vidar Norstein Klungre , Yuanwei Qu , Rudolf Schlatte , Egor V. Kostylev , Martin Giese , Einar Broch Johnsen This is my paper

Pith reviewed 2026-05-18 20:05 UTC · model grok-4.3

classification 💻 cs.PL cs.LO
keywords semantic reflectionknowledge graphsprogram statesobject-oriented programmingruntime queriesdomain knowledgeSMOL
0
0 comments X

The pith

Semantically lifted programs expose program states as queryable knowledge graphs for domain reasoning.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper seeks to resolve the split between representing static structural knowledge in knowledge graphs and dynamic behavioral knowledge in programs. It proposes semantically lifting the runtime states of an object-oriented program into a knowledge graph that is then accessible inside the program through a reflection mechanism. If successful, this would let programmers write code that directly reasons over domain concepts like geological structures while the program runs. The authors formalize the lifting and reflection for a small language SMOL, prove type correctness for the queries, and demonstrate it in a geological modelling example.

Core claim

We introduce semantic lifting of the program states of an executing program into a knowledge graph for an object-oriented programming language. The resulting graph is exposed as a semantic reflection layer within the programming language, allowing programmers to leverage knowledge of the application domain in their programs. We formalize this for SMOL and address type correctness and virtualisation for runtime queries.

What carries the argument

Semantic lifting, the process that converts executing program states into a knowledge graph representation exposed for queries inside the language.

If this is right

  • Queries on the semantic reflection layer are guaranteed to be type-correct.
  • Program behavior can be directly informed by formal domain knowledge without separate data mappings.
  • Virtualisation supports efficient runtime evaluation of such queries.
  • Applications in domains like geological modelling become possible where program logic uses ontological facts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar lifting could be applied to other programming paradigms beyond object-oriented languages.
  • The technique might support self-adaptive systems that update their logic based on changes in the knowledge graph.
  • Integration with external knowledge bases could extend the reflection layer beyond the program's own state.

Load-bearing premise

The automatic translation from concrete program states to the knowledge-graph representation preserves enough structure and semantics for the reflection-layer queries to remain both type-correct and useful for domain reasoning without requiring manual alignment between the program model and the ontology.

What would settle it

If queries executed through the semantic reflection layer in the geological modelling case study produce type errors or semantically incorrect answers compared to the domain ontology, the central claim would be falsified.

Figures

Figures reproduced from arXiv: 2509.03318 by Eduard Kamburjan, Egor V. Kostylev, Einar Broch Johnsen, Martin Giese, Rudolf Schlatte, Vidar Norstein Klungre, Yuanwei Qu.

Figure 23
Figure 23. Figure 23: The typing hierarchy and class table are implicitly given, to avoid syntactic clutter. [PITH_FULL_IMAGE:figures/full_fig_p042_23.png] view at source ↗
read the original abstract

This paper addresses the dichotomy between the formalization of structural and the formalization of behavioral knowledge by means of semantically lifted programs, which explore an intuitive connection between programs and knowledge graphs. While knowledge graphs and ontologies are eminently useful to represent formal knowledge about a system's individuals and universals, programming languages are designed to describe the system's evolution. To address this dichotomy, we introduce a semantic lifting of the program states of an executing program into a knowledge graph, for an object-oriented programming language. The resulting graph is exposed as a semantic reflection layer within the programming language, allowing programmers to leverage knowledge of the application domain in their programs. In this paper, we formalize semantic lifting and semantic reflection for a small programming language, SMOL, explain the operational aspects of the language, and consider type correctness and virtualisation for runtime program queries through the semantic reflection layer. We illustrate semantic lifting and semantic reflection through a case study of geological modelling and discuss different applications of the technique. The language implementation is open source and available online.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces semantically reflected programs for the small object-oriented language SMOL. It defines a semantic lifting operation that maps runtime program states (objects, fields, references) into a knowledge-graph representation, which is then exposed inside the language as a semantic reflection layer. Programmers can therefore write queries against this layer that draw on domain knowledge. The manuscript formalizes the lifting and reflection mechanisms, discusses operational semantics, addresses type correctness and virtualization of the reflection queries, presents a geological-modelling case study, and releases an open-source implementation.

Significance. If the lifting rules preserve enough structure for domain queries to remain both type-correct and semantically meaningful without manual ontology alignment, the work would provide a concrete bridge between imperative program execution and knowledge-graph reasoning. The open-source implementation and the explicit treatment of virtualization are concrete strengths that support reproducibility and further experimentation.

major comments (2)
  1. [§4] §4 (Semantic Lifting): the lifting rules are described as a direct structural encoding (instances to nodes, attributes to properties), yet the central claim requires that this mapping automatically yields a representation on which arbitrary domain-ontology queries remain useful. No explicit construction or proof is given showing how relations not derivable from the program state alone are introduced, which directly affects the “without manual alignment” part of the contribution.
  2. [§5.2] §5.2 (Type Correctness): the argument for type correctness of reflection-layer queries is stated to consider aliasing and dynamic dispatch, but the manuscript supplies neither the precise lifting rules for these cases nor a proof sketch. Because type safety of the reflection layer is load-bearing for the usability claim, the absence of these details leaves the soundness of the central result unverified.
minor comments (2)
  1. [Case Study] The case-study section would benefit from a small code fragment showing an actual reflection-layer query together with the corresponding lifted graph fragment.
  2. [§3] Notation for the knowledge-graph nodes and edges is introduced without a consolidated table; a single summary table would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback and for noting the strengths of the open-source implementation and virtualization treatment. We address each major comment below and will revise the manuscript to supply the requested formal details.

read point-by-point responses

  1. Referee: [§4] §4 (Semantic Lifting): the lifting rules are described as a direct structural encoding (instances to nodes, attributes to properties), yet the central claim requires that this mapping automatically yields a representation on which arbitrary domain-ontology queries remain useful. No explicit construction or proof is given showing how relations not derivable from the program state alone are introduced, which directly affects the “without manual alignment” part of the contribution.

    Authors: We acknowledge that §4 presents semantic lifting primarily as a direct structural encoding from runtime objects and fields to graph nodes and properties. The contribution's claim regarding domain queries without manual alignment rests on the lifted graph faithfully exposing the program's own structure so that queries can be expressed using domain terms aligned to the object model. We agree, however, that the manuscript lacks an explicit construction or proof for introducing relations not derivable from program state alone. In the revision we will add a formal definition of the lifting function together with a clarifying subsection that delimits the scope: structural relations are lifted automatically, while additional domain inferences are supported via query composition or external ontology integration at the reflection layer. This will make the limits of the 'without manual alignment' claim precise. revision: yes

  2. Referee: [§5.2] §5.2 (Type Correctness): the argument for type correctness of reflection-layer queries is stated to consider aliasing and dynamic dispatch, but the manuscript supplies neither the precise lifting rules for these cases nor a proof sketch. Because type safety of the reflection layer is load-bearing for the usability claim, the absence of these details leaves the soundness of the central result unverified.

    Authors: We accept the referee's observation. Although §5.2 asserts that type correctness accounts for aliasing and dynamic dispatch, the manuscript indeed omits the precise lifting rules for these features and any proof sketch. This is a presentational gap that weakens verification of the soundness claim. In the revised manuscript we will insert the detailed lifting rules for aliasing (object-identity preservation across references) and dynamic dispatch (method-resolution reflection), followed by a concise proof sketch establishing type safety of queries executed against the reflection layer. These additions will directly substantiate the usability and soundness arguments. revision: yes

Circularity Check

0 steps flagged

No significant circularity in formalization of semantic lifting

full rationale

The paper introduces and formalizes semantic lifting of program states into knowledge graphs for the SMOL language as a new definitional mechanism, together with operational semantics, type correctness, and virtualization rules. These elements are presented directly through language definitions and a geological modelling case study rather than as predictions derived from fitted parameters or prior equations. No load-bearing steps reduce by construction to self-citations, ansatzes, or renamed inputs; the central claims rest on the explicit formalization and implementation, which remain self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The paper introduces the new concepts of semantic lifting and the semantic reflection layer; these are not derived from prior literature but postulated as the core mechanism. No numerical free parameters are mentioned. The formalization of SMOL relies on standard operational semantics assumptions.

axioms (1)
  • domain assumption Standard operational semantics rules for object-oriented languages can be extended with a lifting function to knowledge graphs while preserving type safety.
    Invoked when defining the semantic lifting and proving type correctness for the reflection layer.
invented entities (2)
  • semantic lifting no independent evidence
    purpose: Automatic translation of runtime program states into a knowledge-graph representation.
    Core new mechanism introduced to bridge programs and ontologies; no independent evidence outside the paper is provided.
  • semantic reflection layer no independent evidence
    purpose: Interface that exposes the lifted knowledge graph inside the running program for queries.
    New language feature defined in the paper; no external validation mentioned.

pith-pipeline@v0.9.0 · 5728 in / 1444 out tokens · 49910 ms · 2026-05-18T20:05:38.410383+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

60 extracted references · 60 canonical work pages

  1. [1]

    Codeontology: Rdf-ization of source code

    Mattia Atzeni and Maurizio Atzori. Codeontology: Rdf-ization of source code. In Proc.\ International Semantic Web Conference ( ISWC 2017) , volume 10588 of Lecture Notes in Computer Science , pages 20--28. Springer, 2017. https://doi.org/10.1007/978-3-319-68204-4\_2 doi:10.1007/978-3-319-68204-4\_2

    work page doi:10.1007/978-3-319-68204-4 2017

  2. [2]

    Rustan M

    Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte. The S pec\# programming system: An overview. In Proc.\ International Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices ( CASSIS 2004) , volume 3362 of Lecture Notes in Computer Science , pages 49--69. Springer, 2004. https://doi.org/10.1007/978-3-540-30569-9\_3 doi...

    work page doi:10.1007/978-3-540-30569-9 2004

  3. [3]

    Object-oriented modeling with ontologies around: A survey of existing approaches

    Selena Baset and Kilian Stoffel. Object-oriented modeling with ontologies around: A survey of existing approaches. Int. J. Softw. Eng. Knowl. Eng. , 28(11-12):1775--1794, 2018. https://doi.org/10.1142/S0218194018400284 doi:10.1142/S0218194018400284

    work page doi:10.1142/s0218194018400284 2018

  4. [4]

    Source rocks and petroleum geochemistry

    Knut Bjørlykke. Source rocks and petroleum geochemistry. Petroleum Geoscience , pages 339--348, 2010

    work page 2010

  5. [5]

    Functional mockup interface 2.0: The standard for tool-independent exchange of simulation models

    Torsten Blochwitz, Martin Otter, Johan Åkesson, Martin Arnold, Christoph Clauss, Hilding Elmqvist, Markus Friedrich, Andreas Junghanns, Jakob Mauss, Dietmar Neumerkel, Hans Olsson, and Antoine Viel. Functional mockup interface 2.0: The standard for tool independent exchange of simulation models. In Modelica Conference , pages 173--184. The Modelica Associ...

    work page doi:10.3384/ecp12076173 2012

  6. [6]

    Actions and programs over description logic knowledge bases: A functional approach

    Diego Calvanese, Giuseppe De Giacomo, et al. Actions and programs over description logic knowledge bases: A functional approach. In Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque . College Press, 2011

    work page 2011

  7. [7]

    Clarke and E

    Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Dexter Kozen, editor, Logics of Programs , volume 131 of Lecture Notes in Computer Science , pages 52--71. Springer, 1981. https://doi.org/10.1007/BFb0025774 doi:10.1007/BFb0025774

    work page doi:10.1007/bfb0025774 1981

  8. [8]

    The birth of object orientation: the S imula languages

    Ole - Johan Dahl. The birth of object orientation: the S imula languages. In Essays in Memory of Ole-Johan Dahl , volume 2635 of Lecture Notes in Computer Science , pages 15--25. Springer, 2004. https://doi.org/10.1007/978-3-540-39993-3\_3 doi:10.1007/978-3-540-39993-3\_3

    work page doi:10.1007/978-3-540-39993-3 2004

  9. [9]

    Silva Souza

    Camila Zacch \' e de Aguiar, Ricardo de Almeida Falbo, and V \' tor E. Silva Souza. OOC-O: A reference ontology on object-oriented code. In Conceptual Modeling ( ER 2019) , volume 11788 of Lecture Notes in Computer Science , pages 13--27. Springer, 2019. https://doi.org/10.1007/978-3-030-33223-5\_3 doi:10.1007/978-3-030-33223-5\_3

    work page doi:10.1007/978-3-030-33223-5 2019

  10. [10]

    Geological multi-scenario reasoning

    Crystal Chang Din, Leif Harald Karlsen, Irina Pene, Oliver Stahl, Ingrid Chieh Yu, and Thomas sterlie. Geological multi-scenario reasoning. In Norsk Informatikkonferanse ( NIK 2019) . Bibsys Open Journal Systems, Norway, 2019. URL: https://ojs.bibsys.no/index.php/NIK/article/view/640

    work page 2019

  11. [11]

    Ontology-mediated probabilistic model checking

    Clemens Dubslaff, Patrick Koopmann, and Anni - Yasmin Turhan. Ontology-mediated probabilistic model checking. In Integrated Formal Methods ( IFM 2019) , volume 11918 of Lecture Notes in Computer Science , pages 194--211. Springer, 2019. https://doi.org/10.1007/978-3-030-34968-4\_11 doi:10.1007/978-3-030-34968-4\_11

    work page doi:10.1007/978-3-030-34968-4 2019

  12. [12]

    Give inconsistency a chance: Semantics for ontology-mediated verification

    Clemens Dubslaff, Patrick Koopmann, and Anni - Yasmin Turhan. Give inconsistency a chance: Semantics for ontology-mediated verification. In Proc.\ Workshop on Description Logics ( DL 2020) , volume 2663 of CEUR Workshop Proceedings . CEUR-WS.org, 2020. URL: https://ceur-ws.org/Vol-2663/paper-9.pdf

    work page 2020

  13. [13]

    Enhancing probabilistic model checking with ontologies

    Clemens Dubslaff, Patrick Koopmann, and Anni - Yasmin Turhan. Enhancing probabilistic model checking with ontologies. Formal Aspects Comput. , 33(6):885--921, 2021. https://doi.org/10.1007/S00165-021-00549-0 doi:10.1007/S00165-021-00549-0

    work page doi:10.1007/s00165-021-00549-0 2021

  14. [14]

    Combining answer set programming with description logics for the semantic web

    Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, and Hans Tompits. Combining answer set programming with description logics for the semantic web. Artif. Intell. , 172(12-13):1495--1539, 2008. https://doi.org/10.1016/J.ARTINT.2008.04.002 doi:10.1016/J.ARTINT.2008.04.002

    work page doi:10.1016/j.artint.2008.04.002 2008

  15. [15]

    Halpern, Yoram Moses, and Moshe Y

    Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Knowledge-based programs. Distributed Comput. , 10(4):199--225, 1997. https://doi.org/10.1007/S004460050038 doi:10.1007/S004460050038

    work page doi:10.1007/s004460050038 1997

  16. [16]

    The geocore ontology: A core ontology for general use in geology

    Luan Fonseca Garcia, Mara Abel, Michel Perrin, and Renata dos Santos Alvarenga. The geocore ontology: A core ontology for general use in geology. Comput. Geosci. , 135:104387, 2020. https://doi.org/10.1016/J.CAGEO.2019.104387 doi:10.1016/J.CAGEO.2019.104387

    work page doi:10.1016/j.cageo.2019.104387 2020

  17. [17]

    On the update of description logic ontologies at the instance level

    Giuseppe De Giacomo, Maurizio Lenzerini, Antonella Poggi, and Riccardo Rosati. On the update of description logic ontologies at the instance level. In Proc.\ Conference on Artificial Intelligence ( AAAI 2006) , pages 1271--1276. AAAI Press, 2006. URL: http://www.aaai.org/Library/AAAI/2006/aaai06-199.php

    work page 2006

  18. [18]

    On the approximation of instance level update and erasure in description logics

    Giuseppe De Giacomo, Maurizio Lenzerini, Antonella Poggi, and Riccardo Rosati. On the approximation of instance level update and erasure in description logics. In Proc.\ Conference on Artificial Intelligence ( AAAI 2007) , pages 403--408. AAAI Press, 2007. URL: http://www.aaai.org/Library/AAAI/2007/aaai07-063.php

    work page 2007

  19. [19]

    Hermit: An owl 2 reasoner,

    Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, and Zhe Wang. Hermit: An OWL 2 reasoner. J. Autom. Reason. , 53(3):245--269, 2014. https://doi.org/10.1007/S10817-014-9305-1 doi:10.1007/S10817-014-9305-1

    work page doi:10.1007/s10817-014-9305-1 2014

  20. [20]

    Co-simulation: A survey.ACM Computing Surveys, 51(3):1–33, May 2018

    Cl \' a udio Gomes, Casper Thule, David Broman, Peter Gorm Larsen, and Hans Vangheluwe. Co-simulation: A survey. ACM Comput. Surv. , 51(3):49:1--49:33, 2018. https://doi.org/10.1145/3179993 doi:10.1145/3179993

    work page doi:10.1145/3179993 2018

  21. [21]

    Patel - Schneider, and Ulrike Sattler

    Bernardo Cuenca Grau, Ian Horrocks, Boris Motik, Bijan Parsia, Peter F. Patel - Schneider, and Ulrike Sattler. OWL 2: The next step for OWL . J. Web Semant. , 6(4):309--322, 2008. https://doi.org/10.1016/j.websem.2008.05.001 doi:10.1016/j.websem.2008.05.001

    work page doi:10.1016/j.websem.2008.05.001 2008

  22. [22]

    Semantic sensor network ontology

    Armin Haller, Krzysztof Janowicz, Simon Cox, Danh Le Phuoc, Kerry Taylor, and Maxime Lefran c ois. Semantic sensor network ontology. W3C recommendation, W3C, 2017. URL: https://www.w3.org/TR/2017/REC-vocab-ssn-20171019/

    work page 2017

  23. [23]

    Anton W. Haubner. Inspecting J ava program states with semantic web technologies. Master's thesis, Technische Universit \"a t Darmstadt, Darmstadt, 2022. The software developed as part of this thesis is available on GitHub. The Semantic Java Debugger: https://github.com/ahbnr/SemanticJavaDebugger The jdi2owl library: https://github.com/ahbnr/jdi2owl. http...

    work page doi:10.26083/tuprints-00022143 2022

  24. [24]

    Foundations of Semantic Web Technologies

    Pascal Hitzler, Markus Kr \" o tzsch, and Sebastian Rudolph. Foundations of Semantic Web Technologies . Chapman and Hall/CRC Press, 2010. https://doi.org/10.1201/9781420090512 doi:10.1201/9781420090512

    work page doi:10.1201/9781420090512 2010

  25. [25]

    A conjunctive query language for description logic ABoxes

    Ian Horrocks and Sergio Tessaris. A conjunctive query language for description logic ABoxes . In Henry A. Kautz and Bruce W. Porter, editors, Proc.\ Conference on Artificial Intelligence ( AAAI 2000) , pages 399--404. AAAI Press / The MIT Press, 2000. URL: http://www.aaai.org/Library/AAAI/2000/aaai00-061.php

    work page 2000

  26. [26]

    a hnle, Jan Sch \

    Einar Broch Johnsen, Reiner H \" a hnle, Jan Sch \" a fer, Rudolf Schlatte, and Martin Steffen. ABS: A core language for abstract behavioral specification. In Formal Methods for Components and Objects ( FMCO 2010) , volume 6957 of Lecture Notes in Computer Science , pages 142--164. Springer, 2010. https://doi.org/10.1007/978-3-642-25271-6\_8 doi:10.1007/9...

    work page doi:10.1007/978-3-642-25271-6 2010

  27. [27]

    Aditya Kalyanpur, Daniel Jim \' e nez Pastor, Steve Battle, and Julian A. Padget. Automatic mapping of OWL ontologies into J ava. In Proc.\ International Conference on Software Engineering & Knowledge Engineering ( SEKE 2004) , pages 98--103, 2004

    work page 2004

  28. [28]

    Declarative lifecycle management in digital twins

    Eduard Kamburjan, Nelly Bencomo, Silvia Lizeth Tapia Tarifa, and Einar Broch Johnsen. Declarative lifecycle management in digital twins. In Proc.\ International Conference on Engineering Digital Twins ( EDTConf 2024) . ACM, 2024

    work page 2024

  29. [29]

    Runtime enforcement using knowledge bases

    Eduard Kamburjan and Crystal Chang Din. Runtime enforcement using knowledge bases. In Proc.\ International Conference on Fundamental Approaches to Software Engineering ( FASE 2023) , volume 13991 of Lecture Notes in Computer Science , pages 220--240. Springer, 2023. https://doi.org/10.1007/978-3-031-30826-0\_12 doi:10.1007/978-3-031-30826-0\_12

    work page doi:10.1007/978-3-031-30826-0 2023

  30. [30]

    On the notion of naturalness in formal modeling

    Eduard Kamburjan and Sandro Rama Fiorini. On the notion of naturalness in formal modeling. In Festschrift Reiner H \" a hnle , volume 13360 of Lecture Notes in Computer Science , pages 264--289. Springer, 2022. https://doi.org/10.1007/978-3-031-08166-8\_13 doi:10.1007/978-3-031-08166-8\_13

    work page doi:10.1007/978-3-031-08166-8 2022

  31. [31]

    Mikkelsen, Daniella Tola, Peter Gorm Larsen, and Michael Sandberg

    Eduard Kamburjan and Einar Broch Johnsen. Knowledge structures over simulation units. In Proc.\ Annual Modeling and Simulation Conference ( ANNSIM 2022) , pages 78--89. IEEE , 2022. https://doi.org/10.23919/ANNSIM55834.2022.9859490 doi:10.23919/ANNSIM55834.2022.9859490

    work page doi:10.23919/annsim55834.2022.9859490 2022

  32. [32]

    Programming and debugging with semantically lifted states

    Eduard Kamburjan, Vidar Norstein Klungre, Rudolf Schlatte, Einar Broch Johnsen, and Martin Giese. Programming and debugging with semantically lifted states. In Proc.\ Extended Semantic Web Conference ( ESWC 2021) , volume 12731 of Lecture Notes in Computer Science , pages 126--142. Springer, 2021. https://doi.org/10.1007/978-3-030-77385-4\_8 doi:10.1007/9...

    work page doi:10.1007/978-3-030-77385-4 2021

  33. [33]

    Digital twin reconguration using asset models

    Eduard Kamburjan, Vidar Norstein Klungre, Rudolf Schlatte, S.\ Lizeth Tarifa Tapia, David Cameron, and Einar Broch Johnsen. Digital twin reconguration using asset models. In Proc.\ International Conference on Leveraging Applications of Formal Methods, Verification and Validation ( ISoLA 2022) , volume 13704 of Lecture Notes in Computer Science , pages 71-...

    work page doi:10.1007/978-3-031-19762-8 2022

  34. [34]

    Kostylev

    Eduard Kamburjan and Egor V. Kostylev. Type checking semantically lifted programs via query containment under entailment regimes. In Proc.\ 34th Intl.\ Workshop on Description Logics ( DL 2021) , volume 2954 of CEUR Workshop Proceedings . CEUR-WS.org, 2021. URL: https://ceur-ws.org/Vol-2954/paper-19.pdf

    work page 2021

  35. [35]

    Semantic reflection and digital twins: A comprehensive overview

    Eduard Kamburjan, Andrea Pferscher, Rudolf Schlatte, Riccardo Sieve, Silvia Lizeth Tapia Tarifa, and Einar Broch Johnsen. Semantic reflection and digital twins: A comprehensive overview. In Mike Hinchey and Bernhard Steffen, editors, The Combined Power of Research, Education, and Dissemination - Essays Dedicated to Tiziana Margaria on the Occasion of Her ...

    work page doi:10.1007/978-3-031-73887-6 2025

  36. [36]

    GreenhouseDT : An exemplar for digital twins

    Eduard Kamburjan, Riccardo Sieve, Chinmayi Prabhu Baramashetru, Marco Amato, Gianluca Barmina, Eduard Occhipinti, and Einar Broch Johnsen. GreenhouseDT : An exemplar for digital twins. In Proc.\ International Conference on Software Engineering for Adaptive and Self-Managing Systems ( SEAMS 2024) , pages 175--181. ACM, 2024. https://doi.org/10.1145/3643915...

    work page doi:10.1145/3643915.3644108 2024

  37. [37]

    Mendelzon

    Hirofumi Katsuno and Alberto O. Mendelzon. On the difference between updating a knowledge base and revising it. In James F. Allen, Richard Fikes, and Erik Sandewall, editors, Principles of Knowledge Representation and Reasoning ( KR 1991) , pages 387--394. Morgan Kaufmann, 1991

    work page 1991

  38. [38]

    Solomou, Christos Pierrakeas, and Achilles Kameas

    Aggeliki Kouneli, Georgia D. Solomou, Christos Pierrakeas, and Achilles Kameas. Modeling the knowledge domain of the J ava programming language as an ontology. In Advances in Web-Based Learning ( ICWL 2012) , volume 7558 of Lecture Notes in Computer Science , pages 152--159. Springer, 2012. https://doi.org/10.1007/978-3-642-33642-3\_16 doi:10.1007/978-3-6...

    work page doi:10.1007/978-3-642-33642-3 2012

  39. [39]

    Kwiatkowska, Gethin Norman, and David Parker

    Marta Z. Kwiatkowska, Gethin Norman, and David Parker. PRISM 4.0: Verification of probabilistic real-time systems. In Computer Aided Verification ( CAV 2011) , volume 6806 of Lecture Notes in Computer Science , pages 585--591. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1\_47 doi:10.1007/978-3-642-22110-1\_47

    work page doi:10.1007/978-3-642-22110-1 2011

  40. [40]

    The essence of functional programming on semantic data

    Martin Leinberger, Ralf L \" a mmel, and Steffen Staab. The essence of functional programming on semantic data. In Proc.\ European Symposium on Programming ( ESOP 2017) , volume 10201 of Lecture Notes in Computer Science , pages 750--776. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1\_28 doi:10.1007/978-3-662-54434-1\_28

    work page doi:10.1007/978-3-662-54434-1 2017

  41. [41]

    Semantic web application development with LITEQ

    Martin Leinberger, Stefan Scheglmann, Ralf L \" a mmel, Steffen Staab, Matthias Thimm, and Evelyne Viegas. Semantic web application development with LITEQ . In Proc.\ International Semantic Web Conference ( ISWC 2014) , volume 8797 of Lecture Notes in Computer Science , pages 212--227. Springer, 2014. https://doi.org/10.1007/978-3-319-11915-1\_14 doi:10.1...

    work page doi:10.1007/978-3-319-11915-1 2014

  42. [42]

    Type checking program code using SHACL

    Martin Leinberger, Philipp Seifer, Claudia Schon, Ralf L \" a mmel, and Steffen Staab. Type checking program code using SHACL . In Proc.\ International Semantic Web Conference ( ISWC 2019) , volume 11778 of Lecture Notes in Computer Science , pages 399--417. Springer, 2019. https://doi.org/10.1007/978-3-030-30793-6\_23 doi:10.1007/978-3-030-30793-6\_23

    work page doi:10.1007/978-3-030-30793-6 2019

  43. [43]

    Levesque, Raymond Reiter, Yves Lesp \' e rance, Fangzhen Lin, and Richard B

    Hector J. Levesque, Raymond Reiter, Yves Lesp \' e rance, Fangzhen Lin, and Richard B. Scherl. GOLOG: A logic programming language for dynamic domains. J. Log. Program. , 31(1-3):59--83, 1997. https://doi.org/10.1016/S0743-1066(96)00121-5 doi:10.1016/S0743-1066(96)00121-5

    work page doi:10.1016/s0743-1066(96)00121-5 1997

  44. [44]

    Conservative extensions in expressive description logics

    Carsten Lutz, Dirk Walther, and Frank Wolter. Conservative extensions in expressive description logics. In Proc.\ International Joint Conference on Artificial Intelligence ( IJCAI 2007) , pages 453--458. IJCAI , 2007. URL: http://ijcai.org/Proceedings/07/Papers/071.pdf

    work page 2007

  45. [45]

    John McCarthy and Patrick J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence , pages 463--502. Edinburgh University Press, 1969

    work page 1969

  46. [46]

    Geothermal gradients in the conterminous united states

    Manuel Nathenson and Marianne Guffanti. Geothermal gradients in the conterminous united states. Journal of Geophysical Research: Solid Earth , 93:6437--6450, 1988. https://doi.org/10.1029/JB093iB06p06437 doi:10.1029/JB093iB06p06437

    work page doi:10.1029/jb093ib06p06437 1988

  47. [47]

    Zhi \# - OWL aware compilation

    Alexander Paar and Denny Vrandecic. Zhi \# - OWL aware compilation. In Proc.\ Extended Semantic Web Conference ( ESWC 2011) , volume 6644 of Lecture Notes in Computer Science , pages 315--329. Springer, 2011. https://doi.org/10.1007/978-3-642-21064-8\_22 doi:10.1007/978-3-642-21064-8\_22

    work page doi:10.1007/978-3-642-21064-8 2011

  48. [48]

    OPAL: an extensible framework for ontology-based program analysis

    Dileep Kumar Pattipati, Rupesh Nasre, and Sreenivasa Kumar Puligundla. OPAL: an extensible framework for ontology-based program analysis. Softw. Pract. Exp. , 50(8):1425--1462, 2020. https://doi.org/10.1002/spe.2821 doi:10.1002/spe.2821

    work page doi:10.1002/spe.2821 2020

  49. [49]

    BOLD: an ontology-based log debugger for C programs

    Dileep Kumar Pattipati, Rupesh Nasre, and Sreenivasa Kumar Puligundla. BOLD: an ontology-based log debugger for C programs. Autom. Softw. Eng. , 29(1):2, 2022. https://doi.org/10.1007/s10515-021-00308-8 doi:10.1007/s10515-021-00308-8

    work page doi:10.1007/s10515-021-00308-8 2022

  50. [50]

    Peters and Mary Rose Cassa

    Kenneth E. Peters and Mary Rose Cassa. Applied source rock geochemistry. In The Petroleum System\,—--\,From Source to Trap . American Association of Petroleum Geologists, 01 1994. https://doi.org/10.1306/M60585C5 doi:10.1306/M60585C5

    work page doi:10.1306/m60585c5 1994

  51. [51]

    Benjamin C. Pierce. Types and programming languages . MIT Press, 2002

    work page 2002

  52. [52]

    A structural approach to operational semantics

    Gordon Plotkin. A structural approach to operational semantics. J. Log. Algebr. Program. , 60-61, 2004

    work page 2004

  53. [53]

    Semantically triggered qualitative simulation of a geological process

    Yuanwei Qu, Eduard Kamburjan, Anita Torabi, and Martin Giese. Semantically triggered qualitative simulation of a geological process. Applied Computing and Geosciences , 21, 2024. https://doi.org/10.1016/j.acags.2023.100152 doi:10.1016/j.acags.2023.100152

    work page doi:10.1016/j.acags.2023.100152 2024

  54. [54]

    Declarative dynamic object reclassification

    Riccardo Sieve, Eduard Kamburjan, Ferruccio Damiani, and Einar Broch Johnsen. Declarative dynamic object reclassification. In Jonathan Aldrich and Alexandra Silva, editors, Proc.\ European Conference on Object-Oriented Programming ( ECOOP 2025) , volume 333 of LIPIcs , pages 29:1--29:31. Schloss Dagstuhl - Leibniz-Zentrum f \" u r Informatik, 2025. https:...

    work page doi:10.4230/lipics.ecoop.2025.29 2025

  55. [55]

    Sapphire: Generating J ava runtime artefacts from OWL ontologies

    Graeme Stevenson and Simon Dobson. Sapphire: Generating J ava runtime artefacts from OWL ontologies. In Advanced Information Systems Engineering Workshops ( CAiSE 2011) , volume 83 of Lecture Notes in Business Information Processing , pages 425--436. Springer, 2011. https://doi.org/10.1007/978-3-642-22056-2\_46 doi:10.1007/978-3-642-22056-2\_46

    work page doi:10.1007/978-3-642-22056-2 2011

  56. [56]

    Subsurface evaluation through multi-scenario reasoning

    Ingrid Chieh Yu, Irina Pene, Crystal Chang Din, Leif Harald Karlsen, Chi Mai Nguyen, Oliver Stahl, and Adnan Latif. Subsurface evaluation through multi-scenario reasoning. In Daniel Patel, editor, Interactive Data Processing and 3D Visualization of the Solid Earth , pages 325--355. Springer, 2021. https://doi.org/10.1007/978-3-030-90716-7_10 doi:10.1007/9...

    work page doi:10.1007/978-3-030-90716-7_10 2021

  57. [57]

    On the representation of temporally changing information in OWL

    Veruska Zamborlini and Giancarlo Guizzardi. On the representation of temporally changing information in OWL . In Workshops Proceedings of the International Enterprise Distributed Object Computing Conference ( EDOCW 2010) , pages 283--292. IEEE Computer Society, 2010. https://doi.org/10.1109/EDOCW.2010.50 doi:10.1109/EDOCW.2010.50

    work page doi:10.1109/edocw.2010.50 2010

  58. [58]

    An ontologically-founded reification approach for representing temporally changing information in owl

    Veruska Carretta Zamborlini and Giancarlo Guizzardi. An ontologically-founded reification approach for representing temporally changing information in owl. In Logical Formalizations of Commonsense Reasoning ( COMMONSENSE 2013) , 2013. URL: http://www.commonsense2013.cs.ucy.ac.cy/docs/commonsense2013_submission_23.pdf

    work page 2013

  59. [59]

    Verification of knowledge-based programs over description logic actions

    Benjamin Zarrie and Jens Cla en. Verification of knowledge-based programs over description logic actions. In Proc.\ International Joint Conference on Artificial Intelligence ( IJCAI 2015) , pages 3278--3284. AAAI Press, 2015. URL: http://ijcai.org/Abstract/15/462

    work page 2015

  60. [60]

    Towards ontology-based program analysis

    Yue Zhao, Guoyang Chen, Chunhua Liao, and Xipeng Shen. Towards ontology-based program analysis. In European Conference on Object-Oriented Programming, ECOOP 2016 , volume 56 of LIPIcs , pages 26:1--26:25. Schloss Dagstuhl - Leibniz-Zentrum f \" u r Informatik, 2016. https://doi.org/10.4230/LIPIcs.ECOOP.2016.26 doi:10.4230/LIPIcs.ECOOP.2016.26

    work page doi:10.4230/lipics.ecoop.2016.26 2016