Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 11
Number of items: 11
  • Stewart, J., & Uckelman, J. (2011). Searching massive data streams using multipattern regular expressions. In G. Peterson, & S. Shenoi (Eds.), Advances in Digital Forensics VII: 7th IFIP WG 11.9 International Conference on Digital Forensics, Orlando, FL, USA, January 31 - February 2, 2011 : revised selected papers (pp. 49-64). (IFIP Advances in Information and Communication Technology; Vol. 361). Springer. https://doi.org/10.1007/978-3-642-24212-0_4
  • Open Access
    Airiau, S., Endriss, U., Grandi, U., Porello, D., & Uckelman, J. (2011). Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections. In T. Walsh (Ed.), IJCAI-11: proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence : Barcelona, Catalonia, Spain, 16-22 July 2011 (Vol. 1, pp. 18-23). AAAI Press/International Joint Conferences on Artificial Intelligence. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-015
  • Uckelman, J. (2010). Alice and Bob will fight: the problem of electing a committee in the presence of candidate interdependence. Frontiers in Artificial Intelligence and Applications, 215, 1023-1024. https://doi.org/10.3233/978-1-60750-606-5-1023
  • Open Access
    Uckelman, J., & Endriss, U. (2010). Compactly representing utility functions using weighted goals and the max aggregator. Artificial Intelligence, 174(15), 1222-1246. https://doi.org/10.1016/j.artint.2010.07.003
  • Open Access
    Uckelman, J., Chevaleyre, Y., Endriss, U., & Lang, J. (2009). Representing utility functions via weighted goals. Mathematical Logic Quarterly, 55(4), 341-361. https://doi.org/10.1002/malq.200810024
  • Open Access
    Uckelman, J. D. (2009). More than the sum of its parts : compact preference representation over combinatorial domains. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Uckelman, J., & Witzel, A. (2008). Logic-based preference languages with intermediate complexity. In Advances in preference handling: Papers from the AAAI workshop (pp. 123-127). AAAI Press. http://www.aaai.org/Library/Workshops/2008/ws08-09-021.php
  • Open Access
    Uckelman, J., & Endriss, U. (2008). Preference modeling by weighted goals with max aggregation. In G. Brewka, & J. Lang (Eds.), Principles of knowledge representation and reasoning: Proceedings of the eleventh international conference (KR 2008) (pp. 579-587). AAAI Press. http://www.aaai.org/Papers/KR/2008/KR08-057.pdf
  • Open Access
    Uckelman, J., & Endriss, U. (2008). Winner determination in combinatorial auctions with logic-based bidding languages. In L. Padgham, D. Parkes, J. Müller, & S. Parsons (Eds.), AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3 (pp. 1617-1620). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). http://portal.acm.org/citation.cfm?id=1402939
  • Uckelman, S. L., & Uckelman, J. D. (2007). Modal and Temporal Logics for Abstract Space-Time Structures. Studies in the History and Philosophy of Modern Physics, 38, 673-681. https://doi.org/10.1016/j.shpsb.2007.01.004
Page 1 of 2