Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Endriss, U. (2011). Applications of Logic in Social Choice Theory: Invited talk. In J. Leite, P. Torroni, T. Ågotnes, G. Boella, & L. van der Torre (Eds.), Computational Logic in Multi-Agent Systems: 12th International Workshop, CLIMA XII, Barcelona, Spain, July 17-18, 2011 : proceedings (pp. 88-91). (Lecture Notes in Computer Science; Vol. 6814), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-642-22359-4_7
  • Porello, D., & Endriss, U. (2011). Ontology Merging as Social Choice. In J. Leite, P. Torroni, T. Ågotnes, G. Boella, & L. van der Torre (Eds.), Computational Logic in Multi-Agent Systems: 12th International Workshop, CLIMA XII, Barcelona, Spain, July 17-18, 2011 : proceedings (pp. 157-170). ( Lecture Notes in Computer Science; Vol. 6814), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-642-22359-4_12
  • Klarman, S., Endriss, U., & Schlobach, S. (2011). ABox Abduction in the Description Logic ALC. Journal of Automated Reasoning, 46(1), 43-80. https://doi.org/10.1007/s10817-010-9168-z
  • Open Access
    Grandi, U., & Endriss, U. (2011). Binary Aggregation with Integrity Constraints. 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. 204-209). AAAI Press/International Joint Conferences on Artificial Intelligence. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-045
  • Open Access
    Geist, C., & Endriss, U. (2011). Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. Journal of Artificial Intelligence Research, 40, 143-174. https://doi.org/10.1613/jair.3126
  • Open Access
    Endriss, U. (2011). Computational Social Choice: Prospects and Challenges. Procedia Computer Science, 7, 68-72. https://doi.org/10.1016/j.procs.2011.12.022
  • Open Access
    Endriss, U. (2011). Logic and social choice theory. In J. van Benthem, & A. Gupta (Eds.), Logic and Philosophy Today; vol. 2 (pp. 333-378). (Studies in Logic; No. 30). College Publications.
  • Open Access
    Endriss, U., Kraus, S., Lang, J., & Wooldridge, M. (2011). Incentive Engineering for Boolean Games. 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. 3, pp. 2602-2607). AAAI Press/International Joint Conferences on Artificial Intelligence. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-433
  • 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
  • Open Access
    Endriss, U., Kraus, S., Lang, J., & Wooldridge, M. (2011). Designing Incentives for Boolean Games. In K. Turner, P. Yolum, L. Sonenberg, & P. Stone (Eds.), AAMAS 2011: the 10th International Conference on Autonomous Agents and Multiagent Systems : May 2-6, 2011, Taipei, Taiwan : proceedings (Vol. 1, pp. 79-86). IFAAMAS. https://dl.acm.org/citation.cfm?id=2030482
Page 11 of 18