Evaluating compliance: from LTL to abductive logic programming

DOI10.3233/FI-2018-1657zbMATH Open1390.68424WikidataQ130148695 ScholiaQ130148695MaRDI QIDQ4637879FDOQ4637879

Authors: Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali 

Publication date: 3 May 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

• Verifying business process compliance by reasoning about actions
• Verifiable agent interaction in abductive logic programming: the SCIFF framework
• Specifying and verifying interaction protocols in a temporal action logic
• Time and compensation mechanisms in checking legal compliance
• LTL on finite and process traces: complexity results and a practical reasoner

zbMATH Keywords

linear temporal logicabductive logic programmingcompliance verification

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60)

This page was built for publication: Evaluating compliance: from LTL to abductive logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637879)