-
Private ltlf2asp
Linear Temporal Logic over Finite Traces (LTLf) is a popular logic to reason about finite sequences of events. In LTLf, the (bounded) satisfiability problem refers to whether... -
Experimental results from the Empirical Investigation of the Completeness of ...
This is the raw data from the empirical investigation of the paper “Completeness of Datasets Documentation on ML/AI repositories: an Empirical Investigation”. This work aim of...