activity
20032025
most citedConsistent query answers on numerical databases under aggregate constraints

5 citations · 8 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2025

Combining Abstract Argumentation and Machine Learning for Efficiently Analyzing Low-Level Process Event Streams

Bettina Fazzinga, Sergio Flesca, Filippo Furfaro +2

Monitoring and analyzing process traces is a critical task for modern companies and organizations. In scenarios where there is a gap between trace events and reference business act…

cs.AI2024★ 3 cited

A Chatbot for Asylum-Seeking Migrants in Europe

Bettina Fazzinga, Elena Palmieri, Margherita Vestoso +4

We present ACME: A Chatbot for asylum-seeking Migrants in Europe. ACME relies on computational argumentation and aims to help migrants identify the highest level of protection they…

cs.DB2013

Consistency Checking and Querying in Probabilistic Databases under Integrity Constraints

Sergio Flesca, Filippo Furfaro, Francesco Parisi

We address the issue of incorporating a particular yet expressive form of integrity constraints (namely, denial constraints) into probabilistic databases. To this aim, we move away…

cs.DB2005★ 5 cited

Consistent query answers on numerical databases under aggregate constraints

Sergio Flesca, Filippo Furfaro, Francesco Parisi

The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defi…

cs.DB2005

Estimating Range Queries using Aggregate Data with Integrity Constraints: a Probabilistic Approach

Francesco Buccafurri, Filippo Furfaro, Domenico Sacca'

The problem of recovering (count and sum) range queries over multidimensional data only on the basis of aggregate information on such data is addressed. This problem can be formali…

cs.LO2003

Minimal founded semantics for disjunctive logic programs and deductive databases

Filippo Furfaro, Gianluigi Greco, Sergio Greco

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable m…