Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Representation Theorem for Change through Composition of Activities

A Representation Theorem for Change through Composition of Activities The expanding use of information systems in industrial and commercial settings has increased the need for interoperation between software systems. In particular, many social, industrial, and business information systems require a common basis for a seamless exchange of complex process information. This is, however, inhibited, because different systems may use distinct terminologies or assume different meanings for the same terms. A common solution to this problem is to develop logical theories that act as an intermediate language between different parties. In this article, we characterize a class of activities that can act as intermediate languages between different parties in those cases. We show that for each domain with finite number of elements there exists a class of activities, we called canonical activities, such that all possible changes within the domain can be represented as a sequence of occurrences of those activities. We use an algebraic structure for representing change and characterizing canonical activities, which enables us to abstract away domain-dependent properties of processes and activities, and demonstrate general properties of formalisms required for semantic integration of dynamic information systems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

A Representation Theorem for Change through Composition of Activities

Download PDF
31 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-representation-theorem-for-change-through-composition-of-activities-IIRFLYKHRE

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3329121
Publisher site
See Article on Publisher Site

Abstract

The expanding use of information systems in industrial and commercial settings has increased the need for interoperation between software systems. In particular, many social, industrial, and business information systems require a common basis for a seamless exchange of complex process information. This is, however, inhibited, because different systems may use distinct terminologies or assume different meanings for the same terms. A common solution to this problem is to develop logical theories that act as an intermediate language between different parties. In this article, we characterize a class of activities that can act as intermediate languages between different parties in those cases. We show that for each domain with finite number of elements there exists a class of activities, we called canonical activities, such that all possible changes within the domain can be represented as a sequence of occurrences of those activities. We use an algebraic structure for representing change and characterizing canonical activities, which enables us to abstract away domain-dependent properties of processes and activities, and demonstrate general properties of formalisms required for semantic integration of dynamic information systems.

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Jul 26, 2019

Keywords: Canonical activities

References

  • Using partial automorphisms to design process ontologies
    Aameri, B.
  • Reasoning about Change with Domain-specific Process Ontologies
    Aameri, B.
  • Reuse with domain and process ontologies
    Aameri, B.; Gruninger, M.
  • Coalition agents experiment: Multi-agent co-operation in an international coalition setting
    Allsopp, D.; Beautement, P.; Bradshaw, J.; Durfee, E.; Kirton, M.; Knoblock, C.; Suri, N.; Tate, A.; Thompson, C.
  • Coo-BDI: Extending the BDI model with cooperativity
    Ancona, D.; Mascardi, V.
  • Harnessing disagreement for event semantics
    Aroyo, L.; Welty, C.
  • Logical properties of foundational relations in bio-ontologies
    Bittner, T.; Donnelly, M.
  • Abstract State Machines: A Method for High-level System Design and Analysis
    Börger, E.; Stärk, R.
  • Inverse semigroups of local automorphisms of universal algebras
    Bredikhin, D. A.
  • ThumbReels: Query sensitive web video previews based on temporal, crowdsourced, semantic tagging
    Craggs, B.; Scott, M. Kilgallon; Alexander, J.
  • Finite Model Theory (2nd ed
    Ebbinghau, H. D.; Flum, J.
  • DynAlloy: Upgrading alloy with actions
    Frias, M. R.; Galeotti, J. P.; Pombo, C. G.; Aguirre, N. M.
  • Classical Finite Transformation Semigroups: An Introduction
    Ganyushkin, O.; Mazorchuk, V.
  • Ontology of the process specification language
    Gruninger, M.
  • Sequential abstract-state machines capture sequential algorithms
    Gurevich, Y.
  • Event-based topology for dynamic planar areal objects
    Jiang, J.; Worboys, M.
  • Coordination in adaptive organisations: Extending shared plans with knowledge cultivation
    Keogh, Kathleen; Sonenberg, Liz; Smith, Wally
  • A logic-based calculus of events
    Kowalski, R.; Sergot, M.
  • Inverse Semigroups: The Theory of Partial Symmetries
    Lawson, M. V.
  • State constraints revisited
    Lin, F.; Reiter, R.
  • Reasoning about time in the situation calculus
    Pinto, J.; Reiter, R.
  • The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
    Reiter, R.
  • Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems
    Reiter, R.
  • Verification of Abstract State Machines
    Schellhorn, G.
  • Verification of ASM refinements using generalized forward simulation
    Schellhorn, Gerhard
  • Crowdsourcing event detection in YouTube video
    Steiner, T.; Verborgh, R.; Van de Walle, R.; Hausenblas, M.; Vallés, J.G.
  • The theory of representation for Boolean algebras
    Stone, M. H.
  • Differentiable manifolds
    Whitney, H.
  • The newest trends in marshalling yards automation
    Zarecky, S.; Grun, J.; Zilka, J.