4 Contributo in Atti di Convegno (Proceeding)

4 Contributo in Atti di Convegno (Proceeding): [18640] Home page macrotipologia

Sfoglia

4.1 Contributo in Atti di convegno 15621
4.2 Abstract in Atti di convegno 2592
4.3 Poster 427

Prodotti recenti

A Direct ASP Encoding for Declare

Answer Set Programming (ASP), a well-known declarative programming paradigm, has recently found practical application in Process Mining, particularly in tasks involving declarative specifications of business processes. Declare is the most popular declarative process modeling language. It provides a way to model processes by sets of constraints, expressed in Linear Temporal Logic over Finite Traces (LTLf ), that valid traces must satisfy. Existing ASP-based solutions encode a Declare constrain...

LTLf2ASP: LTLf Bounded Satisfiability in ASP

Finite variant of Linear Temporal Logic (LTLf) is increasingly popular in Artificial Intelligence (AI).Indeed, several AI applications rely on checking the satisfiability of temporal specifications expressed in LTLf (e.g., planning, and model-checking). This paper describes ltlf2asp, an ASP-based system for bounded satisfiability checking of LTLf formulae. The approach is based on a natural encoding in ASP of temporal operators that is inspired to SAT-based approaches. Experiments show that o...

Scopri

Accesso al fulltext

no fulltext18635
open4
reserved1