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

Dominique Roelants

dblp:25/3857 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Databases, data management, data science and information retrieval · 3Software engineering, systems software and programming languages · 1

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
Database theory · 68% Query processing and optimization · 32%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Database theory
deductive database
0.021991
Controlled Generation of Intensional Answers · IEEE Trans. Knowl. Data Eng. 1991
Constraints for Improving the Generation of Intensional Answers in a Deductive Database · ICDE 1989
Query processing and optimization › query result explanation
intensional answers
0.021991
Controlled Generation of Intensional Answers · IEEE Trans. Knowl. Data Eng. 1991
Constraints for Improving the Generation of Intensional Answers in a Deductive Database · ICDE 1989
Database theory
integrity constraints
0.021991
Constraints for Improving the Generation of Intensional Answers in a Deductive Database · ICDE 1989
Controlled Generation of Intensional Answers · IEEE Trans. Knowl. Data Eng. 1991
Database theory
query answering
0.011991
Controlled Generation of Intensional Answers · IEEE Trans. Knowl. Data Eng. 1991
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
0.011991
Controlled Generation of Intensional Answers · IEEE Trans. Knowl. Data Eng. 1991
Logic in computer science › meta-logic
logical consequence
0.011989
Constraints for Improving the Generation of Intensional Answers in a Deductive Database · ICDE 1989

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

deduction rules · 0.0user modeling · 0.0negation handling · 0.0integrity constraints · 0.0
YearPublicationVenuePosition
1992 Reconciling Operational and Declarative Specifications
Jacques Hagelstein, Dominique Roelants
CAiSE2
1991 Controlled Generation of Intensional Answers
abstract
Intensional answers are conditions that tuples of values must satisfy to belong to the usual extensional answer of a query addressed to a deductive database. The authors review the concept of intensional answers and introduce a general method for generating them as logical consequences of the query and of deduction rules. The authors show how integrity constraints can filter out inadequate answers and produce simpler and more informative answers. An efficient organization for the combination of answers and constraints is described. The introduction of negation in queries and in the body of deduction rules is discussed. Beyond the mechanics of answer generation, the interest of the approach also depends on a strategy for selecting answers to a user submitting a query. This requires techniques for user modeling and dialogue management similar to those required for expert systems.>
Alain Pirotte 0001, Dominique Roelants, Esteban Zimányi
IEEE Trans. Knowl. Data Eng.2
1989 Constraints for Improving the Generation of Intensional Answers in a Deductive Database
abstract
It is shown how intentional answers can be generated as logical consequences of the query and of deduction rules and how integrity constraints can filter out inadequate answers and produce simpler and more informative answers. An efficient organization for the combination of answers and constraints is presented. The authors focus on the design of mechanisms for controlling the generation of intentional answers using integrity constraints. The assertions specified by constraints bear not only on the database but also on queries and intentional answers, since the latter specify sets of values from the database.>
Alain Pirotte 0001, Dominique Roelants
ICDE2