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 commonsense reasoning, nonmonotonic 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 commonsense reasoning. These include belief revision, abduction, argumentation theory, machine learning, probabilistic reasoning and nonmonotonic reasoning in general.
I work both with the theoretical aspects AI, e.g., foundations of AI, translations between logical systems, belief revision in nonclassical logics, merging of argumentation systems, as well as with the application of AI in computer science, including optmisation techniques for requirements engineering, implementation of nonmonotonic 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 commonsense reasoning
 Nonmonotonic reasoning
 Belief revision
 Database updates
 Argumentation theory
 Voting problems and preference aggregation
 Abduction
Recent PC membership
2019
 TAFA, The 2019 International Workshop on Theory and Applications of Formal Argument , Programme Committee member
 IJCAI, The 28th International Joint Conference on Artificial Intelligence, Programme Committee member
 AAMAS, The International Conference on Autonomous Agents and Multiagent Systems  Senior Programme Committee member
 SIGAPP, The 34rd ACM/SIGAPP Symposium On Applied Computing  Programme Committee member
 AAAI, Conference on Artificial Intelligence  Programme Committee member
2018
 COMMA, The International Conference on Computational Models of Argument  Programme Committee member
 SAFA, The International Workshop on Systems and Algorithms for Formal Argumentation  Programme Committee member
 AAAI, Conference on Artificial Intelligence  Programme Committee member
2017
 IJCAI, The International Joint Conference on Artificial Intelligence  Programme Committee member
 AAAI, Conference on Artificial Intelligence  Programme Committee member
 TAFA, The International Workshop on Theory and Applications of Formal Argument  Programme Committee member
2016
 COMMA, The International Conference on Computational Models of Argument  Programme Committee member
 KR, The International Conference on Principles of Knowledge Representation and Reasoning  Programme Committee member
 ECAI, The European Conference on Artificial Intelligence  Programme Committee member
 AAAI, Conference on Artificial Intelligence  Programme Committee member
2015
 IJCAI, The International Joint Conference on Artificial Intelligence  Senior Programme Committee member
 AAAI, Conference on Artificial Intelligence  Programme Committee member
 TAFA, The International Workshop on Theory and Applications of Formal Argument  Programme Committee member
2014
 KR, The International Conference on Principles of Knowledge Representation and Reasoning  Programme Committee member
2011
 DKB, The 3rd Workshop on Dynamics of Knowledge and Belief  Programme Committee member
2010
 IJCAR, The 5th International Joint Conference on Automated Reasoning  Programme Committee member
Other activities
 Coordinator for the area of numerical argumentation in the forthcoming Handbook of Formal Argumentation
 Executive editor of the Journal of Logic and Computation
 Executive editor of the Logical Journal of the IGPL
Teaching
I have taught several modules at BSc and MSc level including:
 Elementary Logic with Applications (20122017)
 Artificial Intelligence (2002 and 20092016)
 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
 Elementary Logic with Applications
 programming Language Design Paradigms
Selected Publications
Year  Details  URL/PDF  

Hao, Q., Keppens, J. and Rodrigues, O., An EntityBased Algorithm for MultipleRelation 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 entitybased algorithm for multiplerelation 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 bioentities 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 verbbased extraction techniques, achieving a precision of extraction of 91.4% and recall of 94% based on the Fmeasure 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{haoetal:18, author = {Q. Hao and J. Keppens and O. Rodrigues}, title = {An EntityBased Algorithm for MultipleRelation Extraction from Single Sentences}, booktitle = {To appear} } 

Rodrigues, O., SCCrecursive 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 SCCrecursive 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{rodriguesscc:18, author = {O. Rodrigues}, title = {SCCrecursive algorithms with conflict detection for decision and enumeration problems in abstract argumentation}, booktitle = {To appear} } 

2019  Rodrigues, O., Representing and Comparing Large Sets of Extensions of Abstract Argumentation Frameworks, Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing (SAC'19), DOI: 10.1145/3297280.3297394, 2019.  URL PDF  
Abstract: In argumentation theory, some reasoning problems involve the enu meration of all extensions of an abstract argumentation framework. Abstractly speaking, extensions are simply subsets of a given do main having some special properties. The result of the enumeration is usually presented as a single text file with elements and sets sepa rated by designated delimiters. Neither the elements within each set (a single extension), nor the extensions themselves are presented in any predefined order. Events such as the International Competition of Computational Models of Argumentation require the compar ison of a large number of enumerations and thus performing the comparisons very efficiently has become very desirable. This paper presents and compares three different alternative representations of extensions, one of which is novel for the argumentation domain, and provides an empirical evaluation of their effectiveness in the comparison of large enumerations. We found that the newly pro posed representation can perform the comparisons in a much more memory and time efficient manner than existing solutions. 

BibTeX:
@inproceedings{rodriguesmpz:19, author = {O. Rodrigues}, title = {Representing and Comparing Large Sets of Extensions of Abstract Argumentation Frameworks}, booktitle = {Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing (SAC'19)}, year = {2019}, doi = {https://doi.org/10.1145/3297280.3297394} } 

2018  Rodrigues, O., EqArgSolver  System Description, Proceedings of the 4th Intl. Conference on Theory and Applications of Formal Argumentation, pp. 150158, DOI: 10.1007/9783319755533_11, 2018. [BibTeX] 
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 = {150158}, doi = {https://doi.org/10.1007/9783319755533_11} } 

2018  Rodrigues, O., A Forward Propagation Algorithm for the Computation of the Semantics of Argumentation Frameworks, Theory and Applications of Formal Argumentation, pp. 120136, DOI: 10.1007/9783319755533_8, 2018. [BibTeX] 
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 = {120136}, doi = {https://doi.org/10.1007/9783319755533_8} } 

2018  Rodrigues, O., An Investigation into Reduction and Direct Approaches to the Computation of Argumentation Semantics, Logic, Intelligence and Artifices: Tributes to Tarcision H. C. Pequeno, pp. 97120, 2018.  
Abstract: This paper compares the performance of the forward propagation algorithm proposed in [15] (which is used in the solver EqArgSolver) with two custombuilt SATbased argumentation solvers in the search for preferred extensions of abstract argumentation frameworks. The SATbased 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{rodriguesRD:17, author = {O. Rodrigues}, title = {An Investigation into Reduction and Direct Approaches to the Computation of Argumentation Semantics}, booktitle = {Logic, Intelligence and Artifices: Tributes to Tarcision H. C. Pequeno}, publisher = {College Publications}, year = {2018}, pages = {97120} } 

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. 3550, DOI: 10.1007/9783319755533_3, 2018. [BibTeX] 
URL PDF  
BibTeX:
@inproceedings{youngetaltafa: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 = {3550}, doi = {https://doi.org/10.1007/9783319755533_3} } 

2017  Hao, Q., Keppens, J. and Rodrigues, O., A Verbbased Algorithm for MultipleRelation Extraction from Single Sentences, Proceedings of the 16th International Conference on Information and Knowledge Engineering, 2017.  
Abstract: With the growing number of unstructured articles written in naturallanguage, automated extraction of knowledge, such as associations between entities, is becoming essential for many applications. In this paper, we develop an automated verbbased algorithm for multiple relation extraction from unstructured data obtained online. 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 Fmeasure 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 singlerelation extraction algorithm, indicating improvements of this work. In conclusion, the preliminary study indicates that this method for multiplerelation 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{haoetal:17, author = {Qi Hao and Jeroen Keppens and Odinaldo Rodrigues}, title = {A Verbbased Algorithm for MultipleRelation 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. 241278, 2016. [BibTeX] 

BibTeX:
@article{bayesargumnetwork: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 = {241278} } 

2016  Gabbay, D. and Rodrigues, O., Degrees of “in”, “out” and “undecided” in Argumentation Networks, Vol. 287, Frontiers in Artificial Intelligence and Applications, pp. 319326, DOI: 10.3233/9781614996866319, 2016. [BibTeX] 
URL PDF  
BibTeX:
@inproceedings{gabbayrodrigues: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 = {319326}, doi = {https://doi.org/10.3233/9781614996866319} } 

2016  Gabbay, D.M. and Rodrigues, O., Further Applications of the GabbayRodrigues Iteration Schema in Argumentation and Revision Theories, Vol. 29, Computational Models of Rationality, pp. 392407, 2016. [BibTeX] 

BibTeX:
@incollection{gabbayrodriguesGKI:16, author = {D. M. Gabbay and O. Rodrigues}, title = {Further Applications of the GabbayRodrigues Iteration Schema in Argumentation and Revision Theories}, booktitle = {Computational Models of Rationality}, publisher = {College Publications}, year = {2016}, volume = {29}, pages = {392407} } 

2016  Hosseini, S.A., Modgil, S. and Rodrigues, O., Estimating SecondOrder Arguments in Dialogical Settings, Proceedings of the 2016 International Conference on Autonomous Agents and Multiagents Systems, pp. 14691470, 2016. [BibTeX] 

BibTeX:
@inproceedings{hosseinimodgilrodrigues:16, author = {S. A. Hosseini and S. Modgil and O. Rodrigues}, title = {Estimating SecondOrder 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 = {14691470} } 

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. 339350, DOI: 10.3233/9781614996866339, 2016. [BibTeX] 
URL PDF  
BibTeX:
@inproceedings{hosseinimodgilrodrigues: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 = {339350}, doi = {https://doi.org/10.3233/9781614996866339} } 

2016  Rodrigues, O., Introducing EqArgSolver: An argumentation solver using equational semantics, 2016. [BibTeX] 

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. 626634, 2016. [BibTeX] 

BibTeX:
@inproceedings{youngmodgilrodrigues: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 = {626634}, 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. 163, DOI: 10.1007/s1178701501197, 2015. [BibTeX] 
URL PDF  
BibTeX:
@article{esnan15, author = {Gabbay, D. M. and Rodrigues, O.}, title = {Equilibrium States in Numerical Argumentation Networks}, journal = {Logica Universalis}, publisher = {Springer Basel}, year = {2015}, pages = {163}, url = {http://dx.doi.org/10.1007/s1178701501197}, doi = {https://doi.org/10.1007/s1178701501197} } 

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. [BibTeX] 
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. 345382, 2015. [BibTeX] 

BibTeX:
@article{probargum:15, author = {D. M. Gabbay and O. Rodrigues}, title = {Probabilistic Argumentation: An Equational Approach.}, journal = {Logica Universalis}, year = {2015}, volume = {9}, number = {3}, pages = {345382} } 

2014  Gabbay, D.M. and Rodrigues, O., A selfcorrecting iteration schema for argumentation networks, Proceedings of COMMA V, pp. 377  384, DOI: 10.3233/9781614994367377, 2014. [BibTeX] 
URL PDF  
BibTeX:
@inproceedings{gabbayrodrigues:COMMA2014, author = {D. M. Gabbay and O. Rodrigues}, title = {A selfcorrecting iteration schema for argumentation networks}, booktitle = {Proceedings of COMMA V}, publisher = {IOS Press}, year = {2014}, pages = {377  384}, doi = {https://doi.org/10.3233/9781614994367377} } 

2014  Gabbay, D.M. and Rodrigues, O., An Equational Approach to the Merging of Argumentation Networks, Journal of Logic and Computation, Vol. 24, pp. 12531277, 2014. [BibTeX] 

BibTeX:
@article{gabbayrodriguesjlc: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 = {12531277} } 

2014  Hosseini, S.A., Modgil, S. and Rodrigues, O., Enthymeme Construction in Dialogues using Shared Knowledge, Proceedings of COMMA V, pp. 325332, DOI: 10.3233/9781614994367325, 2014. [BibTeX] 
URL PDF  
BibTeX:
@inproceedings{hosseinimodgilrodrigues: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 = {325332}, doi = {https://doi.org/10.3233/9781614994367325} } 

2012  Gabbay, D.M. and Rodrigues, O., A Numerical Approach to the Merging of Argumentation Networks, Proceedings of CLIMA XIII, pp. 195212, 2012. [BibTeX] 

BibTeX:
@inproceedings{gabbayrodrigues:12, author = {D. M. Gabbay and O. Rodrigues}, title = {A Numerical Approach to the Merging of Argumentation Networks}, booktitle = {Proceedings of CLIMA XIII}, publisher = {SpringerVerlag}, year = {2012}, pages = {195212} } 

2011  Rodrigues, O., Gabbay, D. and Russo, A., Belief Revision, Handbook of Philosophical Logic: Volume 16, pp. 1114, DOI: 10.1007/9789400704794_1, 2011. [BibTeX] 
URL  
BibTeX:
@incollection{Rodrigues:2011, author = {Odinaldo Rodrigues and Dov Gabbay and Alessandra Russo}, title = {Belief Revision}, booktitle = {Handbook of Philosophical Logic: Volume 16}, publisher = {Springer Netherlands}, year = {2011}, pages = {1114}, url = {https://doi.org/10.1007/9789400704794_1}, doi = {https://doi.org/10.1007/9789400704794_1} } 

2010  Gabbay, D., Rodrigues, O. and Russo, A., Revision, Acceptability and Context: Theoretic and Algorithmic Aspects, pp. 386, DOI: 10.1007/9783642141591, 2010. [BibTeX] 
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/9783642141591}, doi = {https://doi.org/10.1007/9783642141591} } 

2008  Rodrigues, O., Gabbay, D.M. and Russo, A., Belief Revision in NonClassical Logics, Review of Symbolic Logic, Vol. 1, pp. 267304, 2008. [BibTeX] 

BibTeX:
@article{nonclassical2, author = {O. Rodrigues and D. M. Gabbay and A. Russo}, title = {Belief Revision in NonClassical Logics}, journal = {Review of Symbolic Logic}, year = {2008}, volume = {1}, pages = {267304} } 

2006  Elsenbroich, C., Gabbay, D.M. and Rodrigues, O., Getting possibilities from the impossible, Proceedings of NMR06, pp. 505513, 2006. [BibTeX] 

BibTeX:
@inproceedings{elsenbroichgabbayrodrigues06, author = {C. Elsenbroich and D. M. Gabbay and O. Rodrigues}, title = {Getting possibilities from the impossible}, booktitle = {Proceedings of NMR06}, publisher = {Institut fur Informatik}, year = {2006}, pages = {505513}, note = {ISSN 18608477} } 

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. 7178, 2006. [BibTeX] 

BibTeX:
@inproceedings{pigozzigabbayrodrigues06, 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 = {7178} } 

2005  Rodrigues, O., Iterated Revision and Automatic Similarity Generation, Vol. 2, We will show them! Essays in honour of D. M. Gabbay, pp. 591613, 2005. [BibTeX] 

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 = {591613} } 

2004  Gabbay, D.M., Rodrigues, O. and Woods, J., Deletion in Resource Unbounded Logics  Belief Contraction, AntiFormulae and Resource Overdraft: Part II, Vol. 1, Logic, Epistemology and the Unity of Science, pp. 291326, 2004. [BibTeX] 

BibTeX:
@incollection{gabbayrodrigueswoods04, author = {D. M. Gabbay and O. Rodrigues and J. Woods}, title = {Deletion in Resource Unbounded Logics  Belief Contraction, AntiFormulae and Resource Overdraft: Part II}, booktitle = {Logic, Epistemology and the Unity of Science}, publisher = {Kluwer Academic Publishers}, year = {2004}, volume = {1}, pages = {291326} } 

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. 4151, 2004. [BibTeX] 

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 = {SpringerVerlag Berlin Heidelberg}, year = {2004}, pages = {4151}, note = {LNAI 3171} } 

2003  Rodrigues, O., Structured Clusters: A Framework to Reason with Contradictory Interests, Journal of Logic and Computation, Vol. 13 (1), pp. 6997, 2003. [BibTeX] 

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 = {6997} } 

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] 

BibTeX:
@inproceedings{rodriguesgarcezrusso03, 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, AntiFormulae and Resource Overdraft: Part I  Deletion in Resource Bounded Logics, Logic Journal of the IGPL, Vol. 10 (6), pp. 601652, 2002. [BibTeX] 

BibTeX:
@article{gabbayrodrigueswoods02, author = {D. M. Gabbay and O. Rodrigues and J. Woods}, title = {Belief Contraction, AntiFormulae and Resource Overdraft: Part I  Deletion in Resource Bounded Logics}, journal = {Logic Journal of the IGPL}, year = {2002}, volume = {10}, number = {6}, pages = {601652} } 

1999  Gabbay, D.M., Rodrigues, O. and Russo, A., Information, Uncertainty, Fusion, pp. 331, 1999. [BibTeX] 

BibTeX:
@inbook{gabbayrodriguesrusso99, author = {D. M. Gabbay and O. Rodrigues and A. Russo}, title = {Information, Uncertainty, Fusion}, publisher = {Kluwer Academic Publishers}, year = {1999}, pages = {331}, note = {ISBN: 079238590X} } 

1998  Rodrigues, O., A methodology for iterated information changeSchool: Department of Computing, Imperial College, 1998. [BibTeX] 

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. 267281, 1997. [BibTeX] 

BibTeX:
@inproceedings{gabbayrodr:97a, 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 = {SpringerVerlag}, year = {1997}, pages = {267281} } 

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] 

BibTeX:
@inproceedings{gabbayrodr:96a, 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] 

BibTeX:
@inproceedings{gabbayrodrigues96b, 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. 163174, 1996. [BibTeX] 

BibTeX:
@inproceedings{rodrryanschob: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 = {163174} } 

1994  Rodrigues, O. and Benevides, M., PROMAL — Programming in modal action logic, Vol. 844, Programming Language Implementation and Logic Programming, pp. 457458, DOI: 10.1007/3540584021_36, 1994. [BibTeX] 
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 = {457458}, url = {http://dx.doi.org/10.1007/3540584021_36}, doi = {https://doi.org/10.1007/3540584021_36} } 

1994  Rodrigues, O. and Benevides, M.R.F., Belief Revision in PseudoDefinite Sets, Proceedings of the 11th Brazilian Symposium on Artificial Intelligence (SBIA '94), 1994. [BibTeX] 

BibTeX:
@inproceedings{rodriguesbenevides94, author = {O. Rodrigues and M. R. F. Benevides}, title = {Belief Revision in PseudoDefinite 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] 

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 JaneiroRJ, BRAZIL, 1993. [BibTeX] 

BibTeX:
@techreport{rodriguesbenevides93, author = {O. Rodrigues and M. R. F. Benevides}, title = {Revisão de Cren¸ cas em Conjuntos de Cláusulas}, school = {COPPE/UFRJ, Rio de JaneiroRJ, BRAZIL}, year = {1993}, note = {Publica¸ cões Técnicas, ES281/93} } 

1992  Rodrigues, O. and Benevides, M.R.F., Prolog Modal de Ação, Anais do IX SBIA, pp. 339357, 1992. [BibTeX] 

BibTeX:
@inproceedings{rodriguesbenevides92, author = {O. Rodrigues and M. R. F. Benevides}, title = {Prolog Modal de Ação}, booktitle = {Anais do IX SBIA}, year = {1992}, pages = {339357} } 
Books
Revision, Acceptability and Context: Theoretic and Algorithmic Aspects
Springer, 2010.Elementary Logic with Applications: A Procedural Perspective for Computer Scientists
College Publications, 2016.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 8bit "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 datadriven 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 commonsense 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 reductionbased 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 reductionbased 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 colocated 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 AntiFormulae. Logical Modelling of Deletion, 20022005
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.
[ORAPP1] Pointtopoint directions in builtup 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 builtup area such as the Strand Campus, including intrabuilding 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.
[ORAPP2] 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 predefined 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).
[ORLOG1] 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 predefined 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
[ORAT1] 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 [ORAT3] below.
Skills required
 basic computer science concepts: graphs, graph traversal, algorithms
 interface and integration of system components
 JAVA or C++
[ORAT2] 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 argumentationspecific 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++
[ORAT3] 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++
[ORAT4] 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++
[ORAG1] Collaborative environment mapping probes
Imagine a virtual environment with a predefined 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.
[ORJ1] 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
[ORJ2] 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 crossdisciplinary 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, 1pm2pm
 Tuesday, 27/11, 5pm6pm
 Friday, 23/11, 11am12pm
 Friday, 30/11, 11am12pm
Please note the following:
 I will not be able to discuss project topics over email. If you are interested in one of my project topics, please send me an email 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 firstcome firstserved basis, provided I am satisfied that you meet the technical requirements of the project.
 Topic suggestions for all MSc programmes except the MSc in Data Science
 Topic suggestions for the MSc in Data Science only
Topics suggestions for all Msc programmes except the MSc in Data Science

[ORM1] 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 [ORM5] below).
Skills required
 Basic computer science concepts: graphs, graph traversal, algorithms
 Interface and integration of system components
 Knowledge of JAVA
[ORM2] 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++
[ORM3] Collaborative environment mapping probes
Imagine a virtual environment with a predefined 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.
[ORM4] 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 predefined 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
[ORM5] 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++
[ORM6] 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++
[ORM7] 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
[ORM8] 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

[ORM9] Genomewide identification of genetic variants regulating gene expression in obesityrelevant tissues
In this project, the student will conduct genomewide analysis to identify new transregulatory variants, and then integrate these with known disease loci to determine if they mediate genetic risk of disease. The student will investigate transeQTLs in four diseaserelevant tissues, but the focus of the study will be on fat tissue and obesityrelevant diseases. The student will apply a range of statistical programs to identify new transregulatory variants.
Please click here for more details.

[ORM10] 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, 1pm2pm
 Fridays, 10am11am
Trivia
Things I like to do
Contact details
Dr. Odinaldo RodriguesKing's College London
Department of Informatics
London, WC2B 4BG, UK
email: odinaldo.rodrigues@kcl.ac.uk
Tel.: +44 20 7848 2087
Fax: +44 20 7848 2851
Bush House, Strand Campus
Office: BH(N)7.08