Dr Odinaldo Rodrigues

Welcome to my web page

I am a member of the Reasoning and Planing Group in the Department of Informatics at King's College London.

My research concentrates mainly in the area of Artificial Intelligence, more specifically in the formalisation of the common-sense reasoning, non-monotonic reasoning, and numerical aspects of argumentation.

For further information about my academic activities at King's, some references to my research work and how to get in touch with me, please use the links on the menu.

Thank you for your visit!

Research interests

My research interests currently revolve around aspects related to Artificial Intelligence, especially in all aspects of the formalisation of common-sense reasoning. These include belief revision, abduction, argumentation theory, machine learning, probabilistic reasoning and non-monotonic reasoning in general.

I work both with the theoretical aspects AI, e.g., foundations of AI, translations between logical systems, belief revision in non-classical logics, merging of argumentation systems, as well as with the application of AI in computer science, including optmisation techniques for requirements engineering, implementation of non-monotonic reasoning systems, BDI systems, concept classification, computation of semantics of argumentation systems, and the like.

The main areas of research interest are summarised below:

Artificial Intelligence

  • Knowledge representation
  • Numerical methods of reasoning
  • Agent systems
  • BDI reasoning
  • Optimisation, searching, etc

Formalisation of the common-sense reasoning

  • Non-monotonic reasoning
  • Belief revision
  • Database updates
  • Argumentation theory
  • Voting problems and preference aggregation
  • Abduction

Recent PC membership

2019

2018

2017

2016

2015

2014

2011

2010

Other activities

Teaching

I have taught several modules at BSc and MSc level including:

  • Elementary Logic with Applications (2012-2017)
  • Artificial Intelligence (2002 and 2009-2016)
  • Computer Science Logic (2008 and 2009)
  • Distributed Systems (2006 and 2007)
  • Internet Systems (2005 and 2006)
  • Conceptual Analysis (2003 and 2004)
  • Database Systems (1999 to 2002)
  • Computational Logic (2001)
  • Data Structures and their Implementation in C++ (1999 and 2000)
  • Logic and Prolog (1998 and 1999)

Current modules

I am currently on sabbatical leave until 1/9/2018

Selected Publications

Matching entries: 0
settings...
YearDetailsURL/PDF
Hao, Q., Keppens, J. and Rodrigues, O., An Entity-Based Algorithm for Multiple-Relation Extraction from Single Sentences, To appear.
Abstract: A substantial amount of expert Biomedical (and other) knowledge is accumulated in the form of natural language texts, such as peer reviewed journal articles and conference abstracts. Often, such texts establish, substantiate, confirm, question or undermine associations or relationships between entities that are useful for a broad range of applications. Currently, the knowledge contained within a corpus of Biomedical texts is rarely extracted and analysed in a systematic manner, because it is extremely time consuming for humans to do so. Efficient techniques to automatically extract such knowledge would facilitate the development of novel applications that systematically review and reuse the knowledge contained in natural language texts. While such techniques are emerging, they often fail to tackle complex sentence structures properly. They often misinterpret them; fail to recognize embedded relationships; struggle with pronoun references; or have difficulty distinguishing the assertion of a relationship from a conjecture about its existence. In this paper, we present a new entity-based algorithm for multiple-relation extraction from unstructured text obtained in electronic form. The contribution of this paper is threefold. First, our algorithm is able to recognize pronoun references and extract the correct bio-entities they refer to. Second, our algorithm can deal with complex sentence structures. Third, we propose a novel approach to determine whether an extracted relationship should be recorded based on the novel concept of relationship polarity. Our approach offers clear performance advantages over conventional verb-based extraction techniques, achieving a precision of extraction of 91.4% and recall of 94% based on the F-measure over a random sample of sentences from the biomedical literature. The algorithms can also be employed in other knowledge domains by changing the database used to identify entities and verbs of interest.
BibTeX:
@article{hao-et-al:18,
  author = {Q. Hao and J. Keppens and O. Rodrigues},
  title = {An Entity-Based Algorithm for Multiple-Relation Extraction from Single Sentences},
  booktitle = {To appear}
}
Rodrigues, O., SCC-recursive algorithms with conflict detection for decision and enumeration problems in abstract argumentation, To appear.
Abstract: In this paper, we provide algorithms for the computation of solutions to several enumeration and decision problems in abstract argumentation theory. The algorithms use the well known SCC-recursive schema of Baroni, Giacomin and Guida, and offer significant performance advantages especially in argumentation frameworks with a complex structure. In addition, we offer a number of optimisations that allow early termination in problems involving the decision of acceptance of arguments under the grounded, complete, preferred and stable semantics. Our approach paves the way for a new class of argumentation algorithms that use conflict detection and learning to prune the search space of solutions.
BibTeX:
@article{rodrigues-scc:18,
  author = {O. Rodrigues},
  title = {SCC-recursive algorithms with conflict detection for decision and enumeration problems in abstract argumentation},
  booktitle = {To appear}
}
2018 Rodrigues, O., EqArgSolver – System Description, Proceedings of the 4th Intl. Conference on Theory and Applications of Formal Argumentation, pp. 150-158, DOI: 10.1007/978-3-319-75553-3_11, 2018. URL PDF
BibTeX:
@inproceedings{eqargsolver:17,
  author = {Odinaldo Rodrigues},
  title = {EqArgSolver – System Description},
  booktitle = {Proceedings of the 4th Intl. Conference on Theory and Applications of Formal Argumentation},
  year = {2018},
  pages = {150-158},
  doi = {https://doi.org/10.1007/978-3-319-75553-3_11}
}
2018 Rodrigues, O., A Forward Propagation Algorithm for the Computation of the Semantics of Argumentation Frameworks, Theory and Applications of Formal Argumentation, pp. 120-136, DOI: 10.1007/978-3-319-75553-3_8, 2018. URL PDF
BibTeX:
@incollection{Rodrigues_2018,
  author = {Odinaldo Rodrigues},
  title = {A Forward Propagation Algorithm for the Computation of the Semantics of Argumentation Frameworks},
  booktitle = {Theory and Applications of Formal Argumentation},
  publisher = {Springer International Publishing},
  year = {2018},
  pages = {120--136},
  doi = {https://doi.org/10.1007/978-3-319-75553-3_8}
}
2018 Rodrigues, O., An Investigation into Reduction and Direct Approaches to the Computation of Argumentation Semantics, To appear, 2018.  PDF
Abstract: This paper compares the performance of the forward propagation algorithm proposed in [15] (which is used in the solver EqArgSolver) with two custom-built SAT-based argumentation solvers in the search for preferred extensions of abstract argumentation frameworks. The SAT-based solvers employ standard ways of computing argumentation semantics via the characterisation of the concept of extensions as models of propositional logic theories. As a result, the comparisons offer new insights about the employment and combination of reduction and direct approaches to the computation of argumentation semantics.
BibTeX:
@incollection{rodrigues-RD:17,
  author = {O. Rodrigues},
  title = {An Investigation into Reduction and Direct Approaches to the Computation of Argumentation Semantics},
  booktitle = {To appear},
  publisher = {College Publications},
  year = {2018}
}
2018 Young, A.P., Modgil, S. and Rodrigues, O., On the Interaction between Logic and Preference in Structured Argumentation, Theory and Applications of Formal Argumentation, pp. 35-50, DOI: 10.1007/978-3-319-75553-3_3, 2018. URL PDF
BibTeX:
@inproceedings{young-et-al-tafa:17,
  author = {Anthony P. Young and Sanjay Modgil and Odinaldo Rodrigues},
  title = {On the Interaction between Logic and Preference in Structured Argumentation},
  booktitle = {Theory and Applications of Formal Argumentation},
  publisher = {Springer International Publishing},
  year = {2018},
  pages = {35--50},
  doi = {https://doi.org/10.1007/978-3-319-75553-3_3}
}
2017 Hao, Q., Keppens, J. and Rodrigues, O., A Verb-based Algorithm for Multiple-Relation Extraction from Single Sentences, Proceedings of the 16th International Conference on Information and Knowledge Engineering, 2017.  PDF
Abstract: With the growing number of unstructured articles written in natural-language, automated extraction of knowledge, such as associations between entities, is becoming essential for many applications. In this paper, we develop an automated verb-based algorithm for multiple relation extraction from unstructured data obtained on-line. Named Entity Recognition (NER) techniques were applied to extract biomedical entities and relations were recognized by algorithms with Natural Language Processing (NLP) techniques. Evaluation based on F-measure with a random sample of sentences from biomedical literature results an average precision of 90% and recall of 82%. We also compared the performance of the proposed algorithm with a single-relation extraction algorithm, indicating improvements of this work. In conclusion, the preliminary study indicates that this method for multiple-relation extraction from unstructured literature is effective. With different training dataset, the algorithm can be applied to different domains. The automated method can be applied to detect and predict hidden relationships among varying areas.
BibTeX:
@inproceedings{hao-et-al:17,
  author = {Qi Hao and Jeroen Keppens and Odinaldo Rodrigues},
  title = {A Verb-based Algorithm for Multiple-Relation Extraction from Single Sentences},
  booktitle = {Proceedings of the 16th International Conference on Information and Knowledge Engineering},
  year = {2017},
  url = {https://csce.ucmss.com/cr/books/2017/LFS/CSREA2017/IKE3227.pdf}
}
2016 Gabbay, D.M. and Rodrigues, O., Introducing Bayesian Argumentation Networks, The IfColog Journal of Logics and their Applications, Vol. 3 (2), pp. 241-278, 2016.  PDF
BibTeX:
@article{bayes-argum-network:16,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {Introducing Bayesian Argumentation Networks},
  journal = {The IfColog Journal of Logics and their Applications},
  publisher = {College Publications},
  year = {2016},
  volume = {3},
  number = {2},
  pages = {241-278}
}
2016 Gabbay, D. and Rodrigues, O., Degrees of “in”, “out” and “undecided” in Argumentation Networks, Vol. 287, Frontiers in Artificial Intelligence and Applications, pp. 319-326, DOI: 10.3233/978-1-61499-686-6-319, 2016. URL PDF
BibTeX:
@inproceedings{gabbay-rodrigues:16c,
  author = {D. Gabbay and O. Rodrigues},
  title = {Degrees of “in”, “out” and “undecided” in Argumentation Networks},
  booktitle = {Frontiers in Artificial Intelligence and Applications},
  year = {2016},
  volume = {287},
  pages = {319-326},
  doi = {https://doi.org/10.3233/978-1-61499-686-6-319}
}
2016 Gabbay, D.M. and Rodrigues, O., Further Applications of the Gabbay-Rodrigues Iteration Schema in Argumentation and Revision Theories, Vol. 29, Computational Models of Rationality, pp. 392-407, 2016.  PDF
BibTeX:
@incollection{gabbay-rodrigues-GKI:16,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {Further Applications of the Gabbay-Rodrigues Iteration Schema in Argumentation and Revision Theories},
  booktitle = {Computational Models of Rationality},
  publisher = {College Publications},
  year = {2016},
  volume = {29},
  pages = {392-407}
}
2016 Hosseini, S.A., Modgil, S. and Rodrigues, O., Estimating Second-Order Arguments in Dialogical Settings, Proceedings of the 2016 International Conference on Autonomous Agents and Multiagents Systems, pp. 1469-1470, 2016.  PDF
BibTeX:
@inproceedings{hosseini-modgil-rodrigues:16,
  author = {S. A. Hosseini and S. Modgil and O. Rodrigues},
  title = {Estimating Second-Order Arguments in Dialogical Settings},
  booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents and Multiagents Systems},
  publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
  year = {2016},
  pages = {1469-1470}
}
2016 Hosseini, S.A., Modgil, S. and Rodrigues, O., Assigning Likelihoods to Interlocutors' Beliefs and Arguments, Vol. 287, Frontiers in Artificial Intelligence and Applications, pp. 339-350, DOI: 10.3233/978-1-61499-686-6-339, 2016. URL PDF
BibTeX:
@inproceedings{hosseini-modgil-rodrigues:16d,
  author = {S. A Hosseini and S. Modgil and O. Rodrigues},
  title = {Assigning Likelihoods to Interlocutors' Beliefs and Arguments},
  booktitle = {Frontiers in Artificial Intelligence and Applications},
  year = {2016},
  volume = {287},
  pages = {339-350},
  doi = {https://doi.org/10.3233/978-1-61499-686-6-339}
}
2016 Rodrigues, O., Introducing EqArgSolver: An argumentation solver using equational semantics, 2016.  PDF
BibTeX:
@misc{rodrigues:16e,
  author = {O. Rodrigues},
  title = {Introducing EqArgSolver: An argumentation solver using equational semantics},
  year = {2016},
  note = {The First International Workshop on Systems and Algorithms for Formal Argumentation, colocated with COMMA 2016}
}
2016 Young, A., Modgil, S. and Rodrigues, O., Prioritised Default Logic as Rational Argumentation, Proceedings of the 2016 International Conference on Autonomous Agents and Multiagents Systems, pp. 626-634, 2016.  PDF
BibTeX:
@inproceedings{young-modgil-rodrigues:16,
  author = {A. Young and S. Modgil and O. Rodrigues},
  title = {Prioritised Default Logic as Rational Argumentation},
  booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents and Multiagents Systems},
  publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
  year = {2016},
  pages = {626-634},
  url = {http://dl.acm.org/citation.cfm?id=2936924.2937018}
}
2015 Gabbay, D.M. and Rodrigues, O., Equilibrium States in Numerical Argumentation Networks, Logica Universalis, pp. 1-63, DOI: 10.1007/s11787-015-0119-7, 2015. URL PDF
BibTeX:
@article{esnan-15,
  author = {Gabbay, D. M. and Rodrigues, O.},
  title = {Equilibrium States in Numerical Argumentation Networks},
  journal = {Logica Universalis},
  publisher = {Springer Basel},
  year = {2015},
  pages = {1-63},
  url = {http://dx.doi.org/10.1007/s11787-015-0119-7},
  doi = {https://doi.org/10.1007/s11787-015-0119-7}
}
2015 Meneguzzi, F., Rodrigues, O., Oren, N., Vasconcelos, W.W. and Luck, M., BDI reasoning with normative considerations, Engineering Applications of Artificial Intelligence, Vol. 43 (0), pp. 127 - 146, DOI: http://dx.doi.org/10.1016/j.engappai.2015.04.011, 2015. URL PDF
BibTeX:
@article{Meneguzzi2015127,
  author = {F. Meneguzzi and O. Rodrigues and N. Oren and W. W. Vasconcelos and M. Luck},
  title = {BDI reasoning with normative considerations},
  journal = {Engineering Applications of Artificial Intelligence},
  year = {2015},
  volume = {43},
  number = {0},
  pages = {127 - 146},
  url = {http://www.sciencedirect.com/science/article/pii/S0952197615000925},
  doi = {https://doi.org/10.1016/j.engappai.2015.04.011}
}
2015 Gabbay, D.M. and Rodrigues, O., Probabilistic Argumentation: An Equational Approach., Logica Universalis, Vol. 9 (3), pp. 345-382, 2015.  PDF
BibTeX:
@article{prob-argum:15,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {Probabilistic Argumentation: An Equational Approach.},
  journal = {Logica Universalis},
  year = {2015},
  volume = {9},
  number = {3},
  pages = {345-382}
}
2014 Gabbay, D.M. and Rodrigues, O., A self-correcting iteration schema for argumentation networks, Proceedings of COMMA V, pp. 377 - 384, DOI: 10.3233/978-1-61499-436-7-377, 2014. URL PDF
BibTeX:
@inproceedings{gabbay-rodrigues:COMMA2014,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {A self-correcting iteration schema for argumentation networks},
  booktitle = {Proceedings of COMMA V},
  publisher = {IOS Press},
  year = {2014},
  pages = {377 - 384},
  doi = {https://doi.org/10.3233/978-1-61499-436-7-377}
}
2014 Gabbay, D.M. and Rodrigues, O., An Equational Approach to the Merging of Argumentation Networks, Journal of Logic and Computation, Vol. 24, pp. 1253-1277, 2014.
BibTeX:
@article{gabbay-rodrigues-jlc:13,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {An Equational Approach to the Merging of Argumentation Networks},
  journal = {Journal of Logic and Computation},
  publisher = {OUP},
  year = {2014},
  volume = {24},
  pages = {1253-1277}
}
2014 Hosseini, S.A., Modgil, S. and Rodrigues, O., Enthymeme Construction in Dialogues using Shared Knowledge, Proceedings of COMMA V, pp. 325-332, DOI: 10.3233/978-1-61499-436-7-325, 2014. URL PDF
BibTeX:
@inproceedings{hosseini-modgil-rodrigues:COMMA2014,
  author = {S. A. Hosseini and S. Modgil and O. Rodrigues},
  title = {Enthymeme Construction in Dialogues using Shared Knowledge},
  booktitle = {Proceedings of COMMA V},
  publisher = {IOS Press},
  year = {2014},
  pages = {325-332},
  doi = {https://doi.org/10.3233/978-1-61499-436-7-325}
}
2012 Gabbay, D.M. and Rodrigues, O., A Numerical Approach to the Merging of Argumentation Networks, Proceedings of CLIMA XIII, pp. 195-212, 2012.
BibTeX:
@inproceedings{gabbay-rodrigues:12,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {A Numerical Approach to the Merging of Argumentation Networks},
  booktitle = {Proceedings of CLIMA XIII},
  publisher = {Springer-Verlag},
  year = {2012},
  pages = {195-212}
}
2010 Gabbay, D., Rodrigues, O. and Russo, A., Revision, Acceptability and Context: Theoretic and Algorithmic Aspects, pp. 386, DOI: 10.1007/978-3-642-14159-1, 2010. URL
BibTeX:
@book{rac:2010,
  author = {Gabbay, D and Rodrigues, O and Russo, A},
  title = {Revision, Acceptability and Context: Theoretic and Algorithmic Aspects},
  publisher = {Springer Verlag},
  year = {2010},
  pages = {386},
  url = {http://dx.doi.org/10.1007/978-3-642-14159-1},
  doi = {https://doi.org/10.1007/978-3-642-14159-1}
}
2008 Rodrigues, O., Gabbay, D.M. and Russo, A., Belief Revision in Non-Classical Logics, Review of Symbolic Logic, Vol. 1, pp. 267-304, 2008.
BibTeX:
@article{non-classical-2,
  author = {O. Rodrigues and D. M. Gabbay and A. Russo},
  title = {Belief Revision in Non-Classical Logics},
  journal = {Review of Symbolic Logic},
  year = {2008},
  volume = {1},
  pages = {267-304}
}
2006 Elsenbroich, C., Gabbay, D.M. and Rodrigues, O., Getting possibilities from the impossible, Proceedings of NMR-06, pp. 505-513, 2006.
BibTeX:
@inproceedings{elsenbroich-gabbay-rodrigues06,
  author = {C. Elsenbroich and D. M. Gabbay and O. Rodrigues},
  title = {Getting possibilities from the impossible},
  booktitle = {Proceedings of NMR-06},
  publisher = {Institut fur Informatik},
  year = {2006},
  pages = {505-513},
  note = {ISSN 1860-8477}
}
2006 Gabbay, D.M., Pigozzi, G. and Rodrigues, O., Belief revision, belief merging and voting, Proceedings of the Seventh Conference on Logic and the Foundations of Games and Decision Theory (LOFT06), pp. 71-78, 2006.
BibTeX:
@inproceedings{pigozzi-gabbay-rodrigues06,
  author = {D. M. Gabbay and G. Pigozzi and O. Rodrigues},
  title = {Belief revision, belief merging and voting},
  booktitle = {Proceedings of the Seventh Conference on Logic and the Foundations of Games and Decision Theory (LOFT06)},
  publisher = {University of Liverpool},
  year = {2006},
  pages = {71-78}
}
2005 Rodrigues, O., Iterated Revision and Automatic Similarity Generation, Vol. 2, We will show them! Essays in honour of D. M. Gabbay, pp. 591-613, 2005.
BibTeX:
@inbook{rodrigues05,
  author = {O. Rodrigues},
  title = {Iterated Revision and Automatic Similarity Generation},
  booktitle = {We will show them! Essays in honour of D. M. Gabbay},
  publisher = {College Publications},
  year = {2005},
  volume = {2},
  pages = {591-613}
}
2004 Gabbay, D.M., Rodrigues, O. and Woods, J., Deletion in Resource Unbounded Logics - Belief Contraction, Anti-Formulae and Resource Overdraft: Part II, Vol. 1, Logic, Epistemology and the Unity of Science, pp. 291-326, 2004.
BibTeX:
@incollection{gabbay-rodrigues-woods04,
  author = {D. M. Gabbay and O. Rodrigues and J. Woods},
  title = {Deletion in Resource Unbounded Logics - Belief Contraction, Anti-Formulae and Resource Overdraft: Part II},
  booktitle = {Logic, Epistemology and the Unity of Science},
  publisher = {Kluwer Academic Publishers},
  year = {2004},
  volume = {1},
  pages = {291-326}
}
2004 Rodrigues, O., d'Avila Garcez, A. and Russo, A., Reasoning about Requirements Evolution Using Clustered Belief Revision, Advances in Artificial Intelligence, Proceedings of 17th SBIA, pp. 41-51, 2004.
BibTeX:
@inproceedings{se:sbia,
  author = {O. Rodrigues and A. d'Avila Garcez and A. Russo},
  title = {Reasoning about Requirements Evolution Using Clustered Belief Revision},
  booktitle = {Advances in Artificial Intelligence, Proceedings of 17th SBIA},
  publisher = {Springer-Verlag Berlin Heidelberg},
  year = {2004},
  pages = {41-51},
  note = {LNAI 3171}
}
2003 Rodrigues, O., Structured Clusters: A Framework to Reason with Contradictory Interests, Journal of Logic and Computation, Vol. 13 (1), pp. 69-97, 2003.
BibTeX:
@article{clusters,
  author = {O. Rodrigues},
  title = {Structured Clusters: A Framework to Reason with Contradictory Interests},
  journal = {Journal of Logic and Computation},
  year = {2003},
  volume = {13},
  number = {1},
  pages = {69-97}
}
2003 Rodrigues, O., d'Avila Garcez, A. and Russo, A., Reasoning about Requirements Evolution Using Clustered Belief Revision, Proceedings of ACM ESEC/FSE International Workshop on Intelligent Technologies for Software Engineering WITSE03, 2003.
BibTeX:
@inproceedings{rodrigues-garcez-russo03,
  author = {O. Rodrigues and A. d'Avila Garcez and A. Russo},
  title = {Reasoning about Requirements Evolution Using Clustered Belief Revision},
  booktitle = {Proceedings of ACM ESEC/FSE International Workshop on Intelligent Technologies for Software Engineering WITSE03},
  year = {2003}
}
2002 Gabbay, D.M., Rodrigues, O. and Woods, J., Belief Contraction, Anti-Formulae and Resource Overdraft: Part I - Deletion in Resource Bounded Logics, Logic Journal of the IGPL, Vol. 10 (6), pp. 601-652, 2002.
BibTeX:
@article{gabbay-rodrigues-woods02,
  author = {D. M. Gabbay and O. Rodrigues and J. Woods},
  title = {Belief Contraction, Anti-Formulae and Resource Overdraft: Part I - Deletion in Resource Bounded Logics},
  journal = {Logic Journal of the IGPL},
  year = {2002},
  volume = {10},
  number = {6},
  pages = {601-652}
}
1999 Gabbay, D.M., Rodrigues, O. and Russo, A., Information, Uncertainty, Fusion, pp. 3-31, 1999.
BibTeX:
@inbook{gabbay-rodrigues-russo99,
  author = {D. M. Gabbay and O. Rodrigues and A. Russo},
  title = {Information, Uncertainty, Fusion},
  publisher = {Kluwer Academic Publishers},
  year = {1999},
  pages = {3-31},
  note = {ISBN: 0-7923-8590-X}
}
1998 Rodrigues, O., A methodology for iterated information changeSchool: Department of Computing, Imperial College, 1998.  PDF
BibTeX:
@phdthesis{rodrigues98,
  author = {O. Rodrigues},
  title = {A methodology for iterated information change},
  school = {Department of Computing, Imperial College},
  year = {1998}
}
1997 Gabbay, D.M. and Rodrigues, O., Structured Belief Bases: a practical approach to prioritised base revision, Proceedings of First Internation Joint Conference on Qualitative and Quantitative Practical Reasoning, pp. 267-281, 1997.
BibTeX:
@inproceedings{gabbay-rodr:97-a,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {Structured Belief Bases: a practical approach to prioritised base revision},
  booktitle = {Proceedings of First Internation Joint Conference on Qualitative and Quantitative Practical Reasoning},
  publisher = {Springer-Verlag},
  year = {1997},
  pages = {267-281}
}
1996 Gabbay, D.M. and Rodrigues, O., A methodology for iterated Theory Change, Practical Reasoning - First International Conference on Formal and Applied Practical Reasoning, FAPR'96, 1996.
BibTeX:
@inproceedings{gabbay-rodr:96-a,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {A methodology for iterated Theory Change},
  booktitle = {Practical Reasoning - First International Conference on Formal and Applied Practical Reasoning, FAPR'96},
  publisher = {Springer Verlag},
  year = {1996}
}
1996 Gabbay, D.M. and Rodrigues, O., Structured Databases: a framework to reason about Belief Change, Proceedings of the Theory and Formal Methods 1996 workshop, 1996.
BibTeX:
@inproceedings{gabbay-rodrigues96-b,
  author = {D. M. Gabbay and O. Rodrigues},
  title = {Structured Databases: a framework to reason about Belief Change},
  booktitle = {Proceedings of the Theory and Formal Methods 1996 workshop},
  publisher = {Imperial College Press},
  year = {1996}
}
1996 Rodrigues, O., Ryan, M. and Schobbens, P.-Y., Counterfactuals and updates as inverse modalities, 6th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 163-174, 1996.
BibTeX:
@inproceedings{rodr-ryan-schob:96,
  author = {O. Rodrigues and M. Ryan and P.-Y. Schobbens},
  title = {Counterfactuals and updates as inverse modalities},
  booktitle = {6th Conference on Theoretical Aspects of Rationality and Knowledge},
  year = {1996},
  pages = {163-174}
}
1994 Rodrigues, O. and Benevides, M., PROMAL — Programming in modal action logic, Vol. 844, Programming Language Implementation and Logic Programming, pp. 457-458, DOI: 10.1007/3-540-58402-1_36, 1994. URL
BibTeX:
@incollection{promal:94,
  author = {Rodrigues, Odinaldo and Benevides, Mario},
  title = {PROMAL — Programming in modal action logic},
  booktitle = {Programming Language Implementation and Logic Programming},
  publisher = {Springer Berlin Heidelberg},
  year = {1994},
  volume = {844},
  pages = {457-458},
  url = {http://dx.doi.org/10.1007/3-540-58402-1_36},
  doi = {https://doi.org/10.1007/3-540-58402-1_36}
}
1994 Rodrigues, O. and Benevides, M.R.F., Belief Revision in Pseudo-Definite Sets, Proceedings of the 11th Brazilian Symposium on Artificial Intelligence (SBIA '94), 1994.
BibTeX:
@inproceedings{rodrigues-benevides94,
  author = {O. Rodrigues and M. R. F. Benevides},
  title = {Belief Revision in Pseudo-Definite Sets},
  booktitle = {Proceedings of the 11th Brazilian Symposium on Artificial Intelligence (SBIA '94)},
  year = {1994}
}
1993 Rodrigues, O., Prolog Modal de Ação e Revisão de Crenças em Conjuntos DefinidosSchool: COPPE - Universidade Federal do Rio de Janeiro - Brazil, 1993.
BibTeX:
@mastersthesis{rodrigues93,
  author = {O. Rodrigues},
  title = {Prolog Modal de Ação e Revisão de Crenças em Conjuntos Definidos},
  school = {COPPE - Universidade Federal do Rio de Janeiro - Brazil},
  year = {1993},
  note = {Published in the Federal University of Rio de Janeiro, Brazil}
}
1993 Rodrigues, O. and Benevides, M.R.F., Revisão de Cren¸ cas em Conjuntos de CláusulasSchool: COPPE/UFRJ, Rio de Janeiro-RJ, BRAZIL, 1993.
BibTeX:
@techreport{rodrigues-benevides93,
  author = {O. Rodrigues and M. R. F. Benevides},
  title = {Revisão de Cren¸ cas em Conjuntos de Cláusulas},
  school = {COPPE/UFRJ, Rio de Janeiro-RJ, BRAZIL},
  year = {1993},
  note = {Publica¸ cões Técnicas, ES-281/93}
}
1992 Rodrigues, O. and Benevides, M.R.F., Prolog Modal de Ação, Anais do IX SBIA, pp. 339-357, 1992.
BibTeX:
@inproceedings{rodrigues-benevides92,
  author = {O. Rodrigues and M. R. F. Benevides},
  title = {Prolog Modal de Ação},
  booktitle = {Anais do IX SBIA},
  year = {1992},
  pages = {339-357}
}

Short Biography

Although my research is mostly theoretical I have always had a keen interest in the most practical implementation aspects. Computing, and consequently technology, is both my passion and my natural element. This has been the case throughout my life.

I started programming when I was very young (at around 15yo) in the days when a personal computer consisted of a TV attached to an 8-bit "computer" and programs were saved to cassete tapes. You could actually hear the phone ring and the modem tick when you wanted to connect to a remote server. In those days very little support was available to a programmer. BASIC was the most common language keen teenagers like me would use with their computers, but some things we had to do in assembler, a very rudimentary form of machine language. Then PCs came along, programming languages improved (we had Turbo Pascal, then Delphi), and commercial opportunities to make a living out of programming started to become more widespread beyond the realm of mainframes and dumb terminals. That's when a few of us at the University of Fortaleza, myself included, started opening companies and writing software professionally. I remember the first POS system I wrote, where I even had to implement a rudimentary locking mechanism myself to avoid the lost update problem, common in database systems. No database servers were available at the consumer level and only big organisations could afford them, but smaller businesses were seeing the potential for automating some core activities, such as sales, stock control, and reporting, and a few others needed the flexibility and speed that a computer could offer, for instance when calculating the forces applied to a structure supporting a roof. These were the types of problems that spurred my curiosity as a teenager. But if we could solve those problems with a computer, could a machine actually think, or at least behave as if it could?

I quickly realised that I needed to study more, so I applied for a MSc in Artificial Intelligence at COPPE, in the Federal University of Rio de Janeiro, some 3000km away from the city I lived in. The masters then led me to a PhD in Artificial Intelligence, this time even farther away at Imperial College London, 9000km away from Rio.

My first job after my PhD was as Research Assistant in a project involving the development of data-driven algorithms for artificial intelligence. In retrospect, that project was very ahead of its time in 1998.

I am currently Senior Lecturer at King's College London and have taught thousands of students in most of the core computing disciplines: database systems, distributed systems, C++ programming, computational logic, internet systems, artificial language, classical logic, and the like.

I have had a wide variety of administrative duties including publications and publicity, MSc admissions, and more recently I have been chairing the Computing Committee, initially for the Department of Informatics and in the last few years for the whole Faculty of Natural and Mathematical Sciences. Throughout this period, we have seen good progress and exciting new things hapenning at King's, including the inception of HPC facilities such as ADA and Rosalind.

In recent years, my research has veered towards the more practical aspects of common-sense reasoning, particularly in the area of argumentation theory. From dialogues to semantics, including devising numerical methods for argumentation systems and investigating all aspects related to their implementation.

Last year I submitted the prototype of a numerical solver to the first International Competition on Computational Models of Argumentation called GRIS based on theoretical research I had done on numerical argumentation. The prototype showed potential and I have since been working towards implementing a more robust solver called EqArgSolver. The significance of an argumentation solver such as EqArgSolver is that, unlike in reduction-based solvers, it operates on the argumentation graph directly. This puts it in a more robust position to tackle future argumentation problems that may not be possible to solve using reduction-based solvers.

EqArgSolver is not yet ready for general release, but following recent theoretical work, I have implemented a faster core component to replace GRIS' and the development version has already shown up to 12x increase in performance in comparison to GRIS. I have presented these developments in the recent SAFA workshop co-located with COMMA 16. Before EqArgSolver is ready for the next ICCMA, a new key algorithm needs to be developed and shown to be correct before its subsequent implementation. This is currently under way.

Argumentation Solvers

Computation of Argumentation Semantics

EqArgSolver is an argumentation solver that can be used to compute solutions to enumeration and decision problems in the grounded, complete, preferred and stable semantics.

EqArgSolver supersedes GRIS, which was submitted to the 1st International Competition on Computational Models of Argumentation.

EqArgSolver provide a more comprehensive range of semantics, has a smaller memory footprint, and it is up to 12x faster than GRIS. EqArgSolver will be available for general release in Spring 2017. Please check this page for further announcements.

More details about EqArgSolver can be found here.

Research projects

  • EPSRC grant number EP/E034446/1, Connections between belief revision, belief merging and voting, 2006
  • EPSRC grant number GR/R44706/01, Belief Contraction and Anti-Formulae. Logical Modelling of Deletion, 2002-2005
Dr. Odinaldo Rodrigues

BSc/MSci Projects 2018/2019

I prefer to supervise students in emerging topics or in an area related to my research interests.

I am only willing to supervise projects that aim to improve your overall design, reasoning and programming skills. My project topic suggestions may appear demanding, but they are tailored to maximise your professional development and I will assist you throughout the development.

WARNING: this list may contain more topics than I am able to supervise.

  1. [OR-APP-1] Point-to-point directions in built-up areas

    The objective of this project is to write an Android application to provide turn by turn directions on how to get from a designated origin to a target location within a built-up area such as the Strand Campus, including intra-building movements.

    The focus of the project is to be general, creating a domain specification language with associated directions between main locations which can then be applied to any specific site.

    As an example, to provide directions for going from Office S1.26 to Room K1.28, one could explicitly code the directions between S1.26 and K1.28 or have generic rules that identify S1.26 as being in the Strand Building and K1.28 in the King's building and then have directions from going to one building to the other combined with more specific information about the exact locations.

    • Depending on how generic and smart your code is most locations could be covered, but one can limit the scope by reducing the allowed locations.
    • You can enhance this idea in many different ways as you wish.

    You could the release this app for free in Google Play store to help newcomers find their way around in the maze that this campus is.

    You need good general programming skills to successfully deploy this application and willingness to work hard on it.

  2. [OR-APP-2] Story evolution tracker

    Some news stories go on for a number of years and are presented through different perspectives by different sources.

    The objective of this project is to create a story evolution tracker. Basically, the user enters a link to a particular news topic, e.g., on BBC news, and the system will search; classify and track news referring to the same story in a number of pre-defined sources over time. It would be useful to cache a local copy of the story for future reference. At the very least, the program should alert the user about developments on the story appearing in any of the sources.

    You need to carefully create a signature for the story allowing for its identification even when the news headline does not match exactly the original one (which will often be the case).

    You may implement this as an application for mobile devices (Android preferred).


  3. [OR-LOG-1] An automatic natural deduction proof checker for propositional logic.

    Given a set of natural deduction rules, a set of premises, a conclusion and a proof in a pre-defined format, your tool should be able to tell whether the proof is correct or not.

    Your tool should be easy to use and accept proofs from a web interface or input file, convert the proof to an internal language and check whether the proof is correct indicating any wrong steps in the proof.

    Applications

    Your tool will help logic students to learn natural deduction.

    Skills required

    • A good understanding of logic and propositional logic
    • Basic computing skills: data structures, web interfaces, etc
    • JAVA
  4. [OR-AT-1] Computing argumentation semantics

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    Deciding whether a subset of A is an extension of an argumentation framework is a complex problem.

    The objective of this project is to explore this problem as much as possible and come up with an efficient implementation to check whether a given set is an extension of an argumentation framework and/or calculate all extensions of such a framework.

    We are not concerned with the visualisation of the graphs which will be performed by a different application (see project [OR-AT-3] below.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • interface and integration of system components
    • JAVA or C++
  5. [OR-AT-2] Design and Implementation of metrics for abstract argumentation frameworks (AAFs)

    An AAF is a tuple , where A is a set of arguments and R is an attack relation on A x A. Formally speaking, an AAF can be seen as a directed graph.

    The objective of this project is to analyse and implement existing graph metrics, e.g., density, sparsity, etc, as well as to develop new argumentation-specific metrics to help understand the complexity of solving problems in argumentation semantics.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • basic argumentation theory (can be easily acquired)
    • JAVA or C++
  6. [OR-AT-3] A graph visualisation tool for argumentation frameworks

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    The objective of this project is to develop a sophisticated application for graph visualisation to aid in reasoning problems in argumentation theory.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • interface and integration of system components
    • JAVA or C++
  7. [OR-AT-4] An advanced argumentation semantics toolkit

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    The objective of this project is to develop a sophisticated toolkit to aid researchers in argumentation theory.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • interface and integration of system components
    • JAVA or C++
  8. [OR-AG-1] Collaborative environment mapping probes

    Imagine a virtual environment with a pre-defined boundary and some internal objects that need to be mapped by some virtual agents as efficiently as possible.

    Your objective is to produce a global map of this environment based on information collected by the probes which are initially placed randomly in the environment and have the ability to move about and detect objects and the boundary in front of them.

    You need to map the environment as quickly as possible. For this you can assume that the probes have limited ability to move (they may run out of power, for instance).

    Part of your project is to research and choose an appropriate simulation environment such as GridWorld providing basic functionality and some visualisation of the exploration. The core of your project will be on the design of efficient mapping strategies and the communication and coordination aspects between the probes.

  9. [OR-J-1] An extension to JASON to provide some reasoning features using argumentation theory

    JASON is an interpreter for an extended version of AgentSpeak. It can be extended in a number of different ways to perform different kinds of reasoning with agents.

    We will need to discuss one possible extension, that you will design, implement and illustrate with a case study in argumentation theory.

    Skills required

    • Basic computer science concepts: graphs, set theory, IDEs
    • interface and integration of system components
    • JAVA
    • Basic argumentation theory
  10. [OR-J-2] An extension to JASON to support BDI reasoning

    JASON is an interpreter for an extended version of AgentSpeak. It can be extended in a number of different ways to perform different kinds of reasoning with agents.

    You will analyse the paper "BDI reasoning with normative considerations" and see how some of its features can be implemented in JASON.

    Skills required

    • Basic computer science concepts: graphs, set theory, IDEs
    • interface and integration of system components
    • JAVA
    • Basic argumentation theory

MSc projects

I prefer to supervise students in emerging topics or in an area related to my own research interests.

I am only willing to supervise projects that attempt to improve your overall systems design and programming skills. I am particularly interested in cross-disciplinary projects involving applications of AI to new areas. Even though some of the topic suggestions below may appear demanding, they are tailored to maximise your academic and professional development. In all cases, I will providing full assistance and supervision throughout the development of the projects.

Briefing Sessions to Discuss MSc Projects

The consultation period for MSc Project discussion runs from 19/11 until 30/11. During this period, I will be available to see students wishing to enquire about the MSc project topics during the following times:

  • Wednesday, 21/11, 1pm-2pm
  • Tuesday, 27/11, 5pm-6pm
  • Friday, 23/11, 11am-12pm
  • Friday, 30/11, 11am-12pm

Please note the following:

  • I will not be able to discuss project topics over e-mail. If you are interested in one of my project topics, please send me an e-mail indicating which session you would like to attend and I will send you details of the session.
  • Projects cannot be booked during the consultation period. If you are interested in a project, I will take your details and allocate the projects on a first-come first-served basis, provided I am satisfied that you meet the technical requirements of the project.

Topics suggestions for all Msc programmes except the MSc in Data Science

  1. [OR-M1] Computation of argumentation semantics

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    Deciding whether a subset of A is an extension of an argumentation framework under a particular semantics is a complex problem.

    The objective of this project is to explore this problem as much as possible and come up with a portable (JAVA) implementation to check whether a given set is an extension of an argumentation framework and/or calculate all extensions of such a framework. At least two semantics must be used.

    We are not concerned with the visualisation of the graphs which will be performed by an external application (see project [OR-M5] below).

    Skills required

    • Basic computer science concepts: graphs, graph traversal, algorithms
    • Interface and integration of system components
    • Knowledge of JAVA
  2. [OR-M2] Evaluation of Algorithms for the Computation of the Preferred Semantics

    Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics. An Abstract Argumentation Framework is a tuple , where S is a set of arguments and R is an attack relation on S x S.

    Deciding whether a subset of A is an extension of an argumentation framework can be a computationally complex problem.

    The objective of this project is to implement alternative algorithms for the computation of the preferred extensions of an argumentation framework and compare their performance. The implementation may or may not use decomposition techniques, but must implement at least two alternative algorithms and provide a thorough comparison between them.

    There is scope for doing some of the computations in parallel if a decomposition approach is used. The project will attempt to do this as an advanced optional feature

    We are not concerned with the visualisation of the graphs which will be performed by an external application.

    Skills required

    • Basic computer science concepts: graphs, algorithms, parallel algorithms.
    • Interface and integration of system components
    • JAVA or C++
  3. [OR-M3] Collaborative environment mapping probes

    Imagine a virtual environment with a pre-defined boundary and some internal objects that need to be mapped by some virtual agents as efficiently as possible.

    Your objective is to produce a global map of this environment based on information collected by the probes which are initially placed randomly in the environment and have the ability to move about and detect objects and the boundary in front of them.

    You need to map the environment as quickly as possible. For this you can assume that the probes have limited ability to move (they may run out of power, for instance).

    Part of your project is to research and choose an appropriate simulation environment such as GridWorld providing basic functionality and some visualisation of the exploration. The core of your project will be on the design of efficient mapping strategies and the communication and coordination aspects between the probes.

  4. [OR-M4] An automatic natural deduction proof checker for propositional logic.

    Given a set of natural deduction rules, a set of premises, a conclusion and a proof in a pre-defined format, your tool should be able to tell whether the proof is correct or not.

    Your tool should be easy to use and accept proofs from a web interface or input file, convert the proof to an internal language and check whether the proof is correct indicating any wrong steps in the proof.

    Applications

    Your tool will help logic students to learn natural deduction.

    Skills required

    • A good understanding of logic and propositional logic
    • Basic computing skills: data structures, web interfaces, etc
    • JAVA
  5. [OR-M5] A graph visualisation tool for argumentation frameworks

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    The objective of this project is to develop a sophisticated application for graph visualisation to aid in reasoning problems in argumentation theory.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • interface and integration of system components
    • JAVA or C++
  6. [OR-M6] An advanced argumentation semantics toolkit

    An Abstract Argumentation Framework is a tuple , where A is a set of arguments and R is an attack relation on A x A. Argumentation theory provides a means of deciding which arguments win based on the attack relationship of these arguments. An extension is the set of winning arguments under a particular semantics.

    The objective of this project is to develop a sophisticated toolkit to aid researchers in argumentation theory.

    Skills required

    • basic computer science concepts: graphs, graph traversal, algorithms
    • interface and integration of system components
    • JAVA or C++
  7. [OR-M7] An extension to JASON to provide some reasoning features using argumentation theory

    JASON is an interpreter for an extended version of AgentSpeak. It can be extended in a number of different ways to perform different kinds of reasoning with agents.

    We will need to discuss one possible extension, that you will design, implement and illustrate with a case study in argumentation theory.

    Skills required

    • Basic computer science concepts: graphs, set theory, IDEs
    • interface and integration of system components
    • JAVA
    • Basic argumentation theory
  8. [OR-M8] An extension to JASON to support BDI reasoning

    JASON is an interpreter for an extended version of AgentSpeak. It can be extended in a number of different ways to perform different kinds of reasoning with agents.

    You will analyse the paper "BDI reasoning with normative considerations" and see how some of its features can be implemented in JASON.

    Skills required

    • Basic computer science concepts: graphs, set theory, IDEs
    • interface and integration of system components
    • JAVA
    • Basic argumentation theory

Topics for the MSc in Data Science

  1. [OR-M9] Genome-wide identification of genetic variants regulating gene expression in obesity-relevant tissues

    In this project, the student will conduct genome-wide analysis to identify new trans-regulatory variants, and then integrate these with known disease loci to determine if they mediate genetic risk of disease. The student will investigate trans-eQTLs in four disease-relevant tissues, but the focus of the study will be on fat tissue and obesity-relevant diseases. The student will apply a range of statistical programs to identify new trans-regulatory variants.

    Please click here for more details.

  2. [OR-M10] Water Network Modelling

    A project is underway in the Rownhams area of Southampton to measure the behavior of the water network using an abundance (60+) of sensors. This is the first project of its type in the UK and is of significant interest to our regulators. There are two objectives, the first is to find evidence in the sensor data that could explain the causes of discolouration incidents and secondly to understand what normal looks like.

    Please click here for more details.

Office hours

  • Tuesdays, 1pm-2pm
  • Fridays, 10am-11am
Students do not need an appointment to see me during office hours.

Trivia

Things I like to do

  • Write a bit of code: JAVA, C++, PHP, HTML, etc.
  • Play with my camera
  • Read books and stuff
  • Drink a lot of coffee
  • Fix the world
  • Learn about technology
  • Ride my bike
  • Travel the world
  • Maths and computing

Contact details

Dr. Odinaldo Rodrigues
King's College London
Department of Informatics
London, WC2B 4BG, UK
e-mail: odinaldo.rodrigues@kcl.ac.uk
Tel.: +44 20 7848 2087
Fax: +44 20 7848 2851
Bush House, Strand Campus
Office: BH(N)7.08