About Me
I have recently completed a PhD at the Institute for Logic, Language and Computation at the University of Amsterdam working with Ulle Endriss on preference representation as part of the GLoRiClass Project. For more information, see my CV.
Research
Some of my recent work:
2011
Stéphane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello, and Joel Uckelman. Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-2011), July 2011. Poster Paper. Forthcoming. (BibTeX, PDF)
Jon Stewart and Joel Uckelman. lightgrep: A Multipattern Regular Expression Search Tool for Digital Forensics. In Advances in Digital Forensics VII, Springer, 2011. Forthcoming. (BibTeX, PDF)
2010
Jon Stewart and Joel Uckelman. lightgrep: A Multipattern Regular Expression Search Tool for Digital Forensics. In Proceedings of the 2nd Annual Northeast Digital Forensics Exchange, September 2010. Extended abstract. (BibTeX, PDF)
Joel Uckelman and Ulle Endriss. Compactly Representing Utility Functions Using Weighted Goals and the Max Aggregator. Artificial Intelligence 174(15):1222–1246, 2010. (BibTeX, PDF)
Joel Uckelman. Alice and Bob Will Fight: The Problem of Electing a Committee in the Presence of Candidate Interdependence. In J. Lang and P. Perny, eds., Proceedings of the 5th Multidisciplinary Workshop on Advances in Preference Handling (MPREF-2010), Lisbon, Portugal, August 2010. pp. 73–78. (BibTeX, PDF)
Joel Uckelman. Alice and Bob Will Fight: The Problem of Electing a Committee in the Presence of Candidate Interdependence. In H. Coelho, R. Struder and M. Wooldridge, eds., Proceedings of the 19th European Conference on Artificial Intelligence (ECAI-2010), Lisbon, Portugal, August 2010. Short paper. pp. 1023–1024. (BibTeX, PDF)
2009
Joel Uckelman. More Than the Sum of Its Parts: Compact Preference Representation Over Combinatorial Domains. PhD dissertation. University of Amsterdam. ILLC Publication DS-2009-12. 2009. (BibTeX, PDF, errata)
Joel Uckelman, Yann Chevaleyre, Ulle Endriss, and Jérôme Lang. Representing Utility Functions via Weighted Goals. Mathematical Logic Quarterly 55(4):341–361, 2009. (BibTeX, PDF)
2008
Joel Uckelman and Ulle Endriss. Preference Modeling by Weighted Goals with Max Aggregation. In G. Brewka and J. Lang, eds., Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR-2008), Sydney, Australia, September 2008. pp. 579–587. (BibTeX, PDF)
Joel Uckelman and Andreas Witzel. Logic-Based Preference Languages with Intermediate Complexity. In Proceedings of the 4th Multidisciplinary Workshop on Advances in Preference Handling (MPREF-2008), Chicago, July 2008. pp. 123–127. (BibTeX, PDF)
Joel Uckelman and Ulle Endriss. Winner Determination in Combinatorial Auctions with Logic-based Bidding Languages. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2008), Estoril, Portugal, May 2008. Short paper. pp. 1617–1620. (BibTeX, PDF)
2007
Joel Uckelman and Ulle Endriss. Preference Representation with Weighted Goals: Expressivity, Succinctness, Complexity. In Proceedings of the AAAI Workshop on Preference Handling for Artificial Intelligence (AiPref-2007), Vancouver, British Columbia, July 2007. pp. 85–92. (BibTeX, PDF)
Sara L. Uckelman and Joel Uckelman. Modal and temporal logics for abstract space–time structures. Studies in History and Philosophy of Modern Physics 38(3):673–681, 2007. (BibTeX, PDF)