Ricardo Gonçalves
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ricardo Gonçalves has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- João Leite
NOVA School of Science and Technology NOVA LINCS NOVA University Lisbon Portugal
18 shared publications - Matthias Knorr
Universidade Nova de Lisboa
16 shared publications - Carlos Caleiro
Instituto Superior Técnico (IST)
8 shared publications - José Júlio Alferes
Universidade Nova de Lisboa
5 shared publications João Leite
Universidade Nova de Lisboa
5 shared publicationsMatthias Knorr
Universidade Nova de Lisboa
5 shared publications
Latest Publications
- 29 August 2022
- Published by Springer Nature
- p. 287-300
Towards Provenance in Heterogeneous Knowledge Bases
- 29 August 2022
- Published by Springer Nature
- p. 287-300
Towards Provenance in Heterogeneous Knowledge Bases
- Open Access
- 27 December 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (1) , 111-156
Forgetting in Answer Set Programming – A Survey
Forgetting – or variable elimination – is an operation that allows the removal, from a knowledge base, ofmiddlevariables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this article, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.
- 27 December 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (1) , 111-156
Open AccessForgetting in Answer Set Programming – A Survey
Forgetting – or variable elimination – is an operation that allows the removal, from a knowledge base, ofmiddlevariables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this article, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.
- 3 September 2021
- Published by Springer Nature
- p. 363-375
Faster Than LASER - Towards Stream Reasoning with Deep Neural Networks
- 3 September 2021
- Published by Springer Nature
- p. 363-375
Faster Than LASER - Towards Stream Reasoning with Deep Neural Networks
- 12 May 2021
- Published by Springer Nature
- p. 329-345
Tractable Reasoning Using Logic Programs with Intensional Concepts
- 12 May 2021
- Published by Springer Nature
- p. 329-345
Tractable Reasoning Using Logic Programs with Intensional Concepts
- Open Access
- 20 September 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (5-6) , 1038-1055
A Syntactic Operator for Forgetting that Satisfies Strong Persistence
Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence – a property that seems to best capture the essence of forgetting in the context of ASP – whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program.
- 20 September 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (5-6) , 1038-1055
Open AccessA Syntactic Operator for Forgetting that Satisfies Strong Persistence
Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence – a property that seems to best capture the essence of forgetting in the context of ASP – whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program.
- 30 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 552-565
Forgetting in Answer Set Programming with Anonymous Cycles
- 30 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 552-565
Forgetting in Answer Set Programming with Anonymous Cycles
- Open Access
- 17 July 2019
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 33 (01) , 2843-2850
Forgetting in Modular Answer Set Programming
Modular programming facilitates the creation and reuse of large software, and has recently gathered considerable interest in the context of Answer Set Programming (ASP). In this setting, forgetting, or the elimination of middle variables no longer deemed relevant, is of importance as it allows one to, e.g., simplify a program, make it more declarative, or even hide some of its parts without affecting the consequences for those parts that are relevant. While forgetting in the context of ASP has been extensively studied, its known limitations make it unsuitable to be used in Modular ASP. In this paper, we present a novel class of forgetting operators and show that such operators can always be successfully applied in Modular ASP to forget all kinds of atoms – input, output and hidden – overcoming the impossibility results that exist for general ASP. Additionally, we investigate conditions under which this class of operators preserves the module theorem in Modular ASP, thus ensuring that answer sets of modules can still be composed, and how the module theorem can always be preserved if we further allow the reconfiguration of modules.
- 17 July 2019
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 33 (01) , 2843-2850
Open AccessForgetting in Modular Answer Set Programming
Modular programming facilitates the creation and reuse of large software, and has recently gathered considerable interest in the context of Answer Set Programming (ASP). In this setting, forgetting, or the elimination of middle variables no longer deemed relevant, is of importance as it allows one to, e.g., simplify a program, make it more declarative, or even hide some of its parts without affecting the consequences for those parts that are relevant. While forgetting in the context of ASP has been extensively studied, its known limitations make it unsuitable to be used in Modular ASP. In this paper, we present a novel class of forgetting operators and show that such operators can always be successfully applied in Modular ASP to forget all kinds of atoms – input, output and hidden – overcoming the impossibility results that exist for general ASP. Additionally, we investigate conditions under which this class of operators preserves the module theorem in Modular ASP, thus ensuring that answer sets of modules can still be composed, and how the module theorem can always be preserved if we further allow the reconfiguration of modules.
- 1 March 2018
- Published by Elsevier in Artificial Intelligence
- Vol. 256, 68-104
Reactive multi-context systems: Heterogeneous reasoning in dynamic environments
- 1 March 2018
- Published by Elsevier in Artificial Intelligence
- Vol. 256, 68-104
Reactive multi-context systems: Heterogeneous reasoning in dynamic environments
- Open Access
Reactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environments
Managed multi-context systems (mMCSs) allow for the integration of heterogeneous knowledge sources in a modular and very general way. They were, however, mainly designed for static scenarios and are therefore not well-suited for dynamic environments in which continuous reasoning over such heterogeneous knowledge with constantly arriving streams of data is necessary. In this paper, we introduce reactive multi-context systems (rMCSs), a framework for reactive reasoning in the presence of heterogeneous knowledge sources and data streams. We show that rMCSs are indeed well-suited for this purpose by illustrating how several typical problems arising in the context of stream reasoning can be handled using them, by showing how inconsistencies possibly occurring in the integration of multiple knowledge sources can be handled, and by arguing that the potential non-determinism of rMCSs can be avoided if needed using an alternative, more skeptical well-founded semantics instead with beneficial computational properties. We also investigate the computational complexity of various reasoning problems related to rMCSs. Finally, we discuss related work, and show that rMCSs do not only generalize mMCSs to dynamic settings, but also capture/extend relevant approaches w.r.t. dynamics in knowledge representation and stream reasoning.
Open AccessReactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environments
Managed multi-context systems (mMCSs) allow for the integration of heterogeneous knowledge sources in a modular and very general way. They were, however, mainly designed for static scenarios and are therefore not well-suited for dynamic environments in which continuous reasoning over such heterogeneous knowledge with constantly arriving streams of data is necessary. In this paper, we introduce reactive multi-context systems (rMCSs), a framework for reactive reasoning in the presence of heterogeneous knowledge sources and data streams. We show that rMCSs are indeed well-suited for this purpose by illustrating how several typical problems arising in the context of stream reasoning can be handled using them, by showing how inconsistencies possibly occurring in the integration of multiple knowledge sources can be handled, and by arguing that the potential non-determinism of rMCSs can be avoided if needed using an alternative, more skeptical well-founded semantics instead with beneficial computational properties. We also investigate the computational complexity of various reasoning problems related to rMCSs. Finally, we discuss related work, and show that rMCSs do not only generalize mMCSs to dynamic settings, but also capture/extend relevant approaches w.r.t. dynamics in knowledge representation and stream reasoning.