2010•Lecture notes in computer scienceRequires access

Consistent Answers to Boolean Aggregate Queries under Aggregate Constraints

Sergio Flesca, Filippo Furfaro, Francesco Parisi

Open publisher page 5 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Aggregate (composite), Computer science, Set (abstract data type), Boolean data type, Integer programming, Linear programming, Deductive database, Integer (computer science)

Back to paper search Browse research topics Original source

Consistent Answers to Boolean Aggregate Queries under Aggregate Constraints — Research Paper | ScholarLens