Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vittorio Brusoni

dblp:66/5536 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data models and query languages · 54% Spatial and temporal data management · 46%
Artificial intelligence
2 papers
Knowledge representation and reasoning · 100%
Theoretical computer science
2 papers
Computational complexity · 69% Logic in computer science · 31%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › temporal data model
temporal constraints
0.011999
Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications · IEEE Trans. Knowl. Data Eng. 1999
Spatial and temporal data management
temporal databases
0.011999
Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications · IEEE Trans. Knowl. Data Eng. 1999
Knowledge, reasoning and agents › Knowledge representation and reasoning › diagnosis
model-based diagnosis
0.011998
A Spectrum of Definitions for Temporal Model-Based Diagnosis · Artif. Intell. 1998
Computational complexity
query complexity
0.011995
On the Computational Complexity of Querying Bounds on Differences Constraints · Artif. Intell. 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning › temporal reasoning
simple temporal problem
0.011999
Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications · IEEE Trans. Knowl. Data Eng. 1999
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
0.011999
Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications · IEEE Trans. Knowl. Data Eng. 1999
Logic in computer science
temporal logic
0.011998
A Spectrum of Definitions for Temporal Model-Based Diagnosis · Artif. Intell. 1998
Data models and query languages › constraint databases
constraint query languages
0.011995
On the Computational Complexity of Querying Bounds on Differences Constraints · Artif. Intell. 1995

Methods — techniques the papers use, named apart from their topics

temporal reasoner integration · 0.0relational model extension · 0.0
YearPublicationVenuePosition
1999 Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications
abstract
Many different applications in different areas need to deal with both: databases, in order to take into account large amounts of structured data; and quantitative and qualitative temporal constraints about such data. We propose an approach that extends: temporal databases and artificial intelligence temporal reasoning techniques and integrate them in order to face such a need. Regarding temporal reasoning, we consider some results that we proved recently about efficient query answering in the Simple Temporal Problem framework and we extend them in order to deal with partitioned sets of constraints and to support relational database operations. Regarding databases, we extend the relational model in order to consider also qualitative and quantitative temporal constraints both in the data (data expressiveness) and in the queries (query expressiveness). We then propose a modular architecture integrating a relational database with a temporal reasoner. We also consider classes of applications that fit into our approach and consider patient management in a hospital as an example.
Vittorio Brusoni, Luca Console, Paolo Terenziani, Barbara Pernici
IEEE Trans. Knowl. Data Eng.1
1998 A Spectrum of Definitions for Temporal Model-Based Diagnosis
Vittorio Brusoni, Luca Console, Paolo Terenziani, Daniele Theseider Dupré
Artif. Intell.1
1997 Clinical-Mate: A Manager of Temporal Databases for Clinical Applications
Vittorio Brusoni, Luca Console, F. Molino, Gianpaolo Molino, E. Nicolosi, Paolo Terenziani
AMIA1
1996 Resource-Based vs. Task-Based Approaches for Scheduling Problems
Vittorio Brusoni, Luca Console, Evelina Lamma, Paola Mello, Michela Milano, Paolo Terenziani
ISMIS1
1995 On the Computational Complexity of Querying Bounds on Differences Constraints
Vittorio Brusoni, Luca Console, Paolo Terenziani
Artif. Intell.1
1994 LaTeR: A General Purpose Manager of Temporal Information
Vittorio Brusoni, Luca Console, Barbara Pernici, Paolo Terenziani
ISMIS1