crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 765128

Časopis

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn; Perović, Ranko
Naslov: A rewriting framework and logic for activities subject to regulations
( A rewriting framework and logic for activities subject to regulations )
Izvornik: Mathematical structures in computer science (0960-1295) 27 (2015), 3; 332-375
Vrsta rada: članak
Ključne riječi: Multiset Rewrite Systems ; Collaborative Systems ; Applications of Rewrite Systems ; Clinical Investigations ; Computational Complexity ; Linear Logic
( Multiset Rewrite Systems ; Collaborative Systems ; Applications of Rewrite Systems ; Clinical Investigations ; Computational Complexity ; Linear Logic )
Sažetak:
Activities such as clinical investigations (CIs) or financial processes are subject to regulations to ensure quality of results and avoid negative consequences. Regulations may be imposed by multiple governmental agencies as well as by institutional policies and protocols. Due to the complexity of both regulations and activities, there is great potential for violation due to human error, misunderstanding, or even intent. Executable formal models of regulations, protocols and activities can form the foundation for automated assistants to aid planning, monitoring and compliance checking. We propose a model based on multiset rewriting where time is discrete and is specified by timestamps attached to facts. Actions, as well as initial, goal and critical states may be constrained by means of relative time constraints. Moreover, actions may have non- deterministic effects, i.e. they may have different outcomes whenever applied. We present a formal semantics of our model based on focused proofs of linear logic with definitions. We also determine the computational complexity of various planning problems. Plan compliance problem, for example, is the problem of finding a plan that leads from an initial state to a desired goal state without reaching any undesired critical state. We consider all actions to be balanced, i.e. their pre- and post- conditions have the same number of facts. Under this assumption on actions, we show that the plan compliance problem is PSPACE-complete when all actions have only deterministic effects and is EXPTIME- complete when actions may have non- deterministic effects. Finally, we show that the restrictions on the form of actions and time constraints taken in the specification of our model are necessary for decidability of the planning problems.
Izvorni jezik: eng
Rad je indeksiran u
bazama podataka:
Current Contents Connect (CCC)
Scopus
SCI-EXP, SSCI i/ili A&HCI
Science Citation Index Expanded (SCI-EXP) (sastavni dio Web of Science Core Collectiona)
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo
URL Internet adrese: https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/rewriting-framework-and-logic-for-activities-subject-to-regulations/C47ACE2412E5D7F57B044CB361BC53F7
https://doi.org/10.1017/S096012951500016X
Broj citata:
Altmetric:
DOI: 10.1017/S096012951500016X
URL cjelovitog teksta:
Google Scholar: A rewriting framework and logic for activities subject to regulations
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 13. Lip. 2015. u 12:22 sati
Napomene:
Rad je kao predavanje prezentiran a skupu 4th Conference Logic and Applications 2015 (LAP 2015) "Rewriting Framework and Logic for Activities Subject to Regulations", održanom od 21-25.9.2015.g., Dubrovnik, Hrvatska ; uz međunarodnu recenziju objavljen u Knjizi sažetaka, 2015. ; str. 32-33.



  Verzija za printanje   za tiskati


upomoc
foot_4