Suchergebnisse

Ce texte est un rapport d'étape issu de l'ACI cognitique ; Les nouvelles technologies de l'information et de la communication rendent cruciale la construction d'artefacts capables d'agir de manière flexible et autonome dans des environnements dynamiques et partiellement imprédictibles. La spécificité de ces artefacts de nouvelle génération réside dans leur capacité à s'adapter au monde extérieur (comprenant aussi bien le monde « physique » que les croyances et intentions des autres agents), en fonction des actions entreprises et des observations effectuées. L' objectif de ce projet est la conception de modèles et de langages pour la programmation d'agents cognitifs complexes. Ces agents doivent être en mesure de poursuivre un but en planifiant des actions de façon autonome, d'acquérir des informations au moyen d'actions épistémiques et de communiquer avec des interlocuteurs (humains ou machines) au moyen d'actions de communication qu'il s'agira de produire aussi bien que d'interpréter. Un agent cognitif est naturellement destiné à être interfacé d'une manière ou d'une autre avec des opérateurs humains : il s'agit alors d'interpréter de la façon la plus fiable possible les croyances, intentions, préférences et buts de l'utilisateur, ce qui nécessite que les modèles et les langages manipulés par l'agent cognitif soient suffisamment proches des raisonnements humains et du langage naturel, et puissent donc être validés d'un point de vue psychologique et linguistique.

Ce texte est un rapport d'étape issu de l'ACI cognitique ; Les nouvelles technologies de l'information et de la communication rendent cruciale la construction d'artefacts capables d'agir de manière flexible et autonome dans des environnements dynamiques et partiellement imprédictibles. La spécificité de ces artefacts de nouvelle génération réside dans leur capacité à s'adapter au monde extérieur (comprenant aussi bien le monde « physique » que les croyances et intentions des autres agents), en fonction des actions entreprises et des observations effectuées. L' objectif de ce projet est la conception de modèles et de langages pour la programmation d'agents cognitifs complexes. Ces agents doivent être en mesure de poursuivre un but en planifiant des actions de façon autonome, d'acquérir des informations au moyen d'actions épistémiques et de communiquer avec des interlocuteurs (humains ou machines) au moyen d'actions de communication qu'il s'agira de produire aussi bien que d'interpréter. Un agent cognitif est naturellement destiné à être interfacé d'une manière ou d'une autre avec des opérateurs humains : il s'agit alors d'interpréter de la façon la plus fiable possible les croyances, intentions, préférences et buts de l'utilisateur, ce qui nécessite que les modèles et les langages manipulés par l'agent cognitif soient suffisamment proches des raisonnements humains et du langage naturel, et puissent donc être validés d'un point de vue psychologique et linguistique.

Ce texte est un rapport d'étape issu de l'ACI cognitique ; Les nouvelles technologies de l'information et de la communication rendent cruciale la construction d'artefacts capables d'agir de manière flexible et autonome dans des environnements dynamiques et partiellement imprédictibles. La spécificité de ces artefacts de nouvelle génération réside dans leur capacité à s'adapter au monde extérieur (comprenant aussi bien le monde « physique » que les croyances et intentions des autres agents), en fonction des actions entreprises et des observations effectuées. L' objectif de ce projet est la conception de modèles et de langages pour la programmation d'agents cognitifs complexes. Ces agents doivent être en mesure de poursuivre un but en planifiant des actions de façon autonome, d'acquérir des informations au moyen d'actions épistémiques et de communiquer avec des interlocuteurs (humains ou machines) au moyen d'actions de communication qu'il s'agira de produire aussi bien que d'interpréter. Un agent cognitif est naturellement destiné à être interfacé d'une manière ou d'une autre avec des opérateurs humains : il s'agit alors d'interpréter de la façon la plus fiable possible les croyances, intentions, préférences et buts de l'utilisateur, ce qui nécessite que les modèles et les langages manipulés par l'agent cognitif soient suffisamment proches des raisonnements humains et du langage naturel, et puissent donc être validés d'un point de vue psychologique et linguistique.

This text is a progress report from the Cognitic ACI. New information and communication technologies make it crucial to build artefacts capable of acting flexibly and autonomously in dynamic and partially unpredictable environments. The specificity of these new generation artefacts lies in their ability to adapt to the outside world (including both the 'physical' world and the beliefs and intentions of other agents), depending on the actions taken and the observations made. The objective of this project is the design of models and languages for programming complex cognitive agents. They must be able to pursue a goal by planning actions autonomously, to acquire information through epistemic actions and to communicate with interlocutors (human or machine) through communication actions, both to produce and interpret. A cognitive agent is naturally intended to be interfaced in one way or another with human operators: the aim is to interpret the user's beliefs, intentions, preferences and aims in the most reliable way, which requires that the models and languages handled by the cognitive agent be sufficiently close to human reasoning and natural language, and can therefore be validated from a psychological and linguistic point of view. ; Ce texte est un rapport d'étape issu de l'ACI cognitique Les nouvelles technologies de l'information et de la communication rendent cruciale la construction d'artefacts capables d'agir de manière flexible et autonome dans des environnements dynamiques et partiellement imprédictibles. La spécificité de ces artefacts de nouvelle génération réside dans leur capacité à s'adapter au monde extérieur (comprenant aussi bien le monde « physique » que les croyances et intentions des autres agents), en fonction des actions entreprises et des observations effectuées. L' objectif de ce projet est la conception de modèles et de langages pour la programmation d'agents cognitifs complexes. Ces agents doivent être en mesure de poursuivre un but en planifiant des actions de façon autonome, d'acquérir ...

International audience ; One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem

International audience ; One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem

International audience ; One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem

International audience ; One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem

One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem

International audience ; Single Transferable Vote (STV) is used in large political elections around the world. It is easy to understand and has desirable norma-tive properties such as clone-proofness. However, voters need to report full rankings, which can make it less practical than plurality voting. We study ways to minimize the amount of communication required to use single-winner STV. In the first part of the paper, voters are assumed to report their top-k alternatives in a single shot. We empirically evaluate the extent to which STV with truncated ballots approximates STV with full information. We also study the computational complexity of the possible winner problem for top-k ballots. For k = 1, it can be solved in polynomial time, but is NP-complete when k ⩾ 2. In the second part, we consider interactive communication protocols for STV. Building on a protocol proposed by Conitzer and Sandholm (2005), we show how we can reduce the amount of communication required in practice. We then study empirically the average communication complexity of these protocols , based on randomly generated profiles, and on real-world election data. Our conclusion is that STV needs, in practice, much less information than in the worst case.

International audience ; Single Transferable Vote (STV) is used in large political elections around the world. It is easy to understand and has desirable norma-tive properties such as clone-proofness. However, voters need to report full rankings, which can make it less practical than plurality voting. We study ways to minimize the amount of communication required to use single-winner STV. In the first part of the paper, voters are assumed to report their top-k alternatives in a single shot. We empirically evaluate the extent to which STV with truncated ballots approximates STV with full information. We also study the computational complexity of the possible winner problem for top-k ballots. For k = 1, it can be solved in polynomial time, but is NP-complete when k ⩾ 2. In the second part, we consider interactive communication protocols for STV. Building on a protocol proposed by Conitzer and Sandholm (2005), we show how we can reduce the amount of communication required in practice. We then study empirically the average communication complexity of these protocols , based on randomly generated profiles, and on real-world election data. Our conclusion is that STV needs, in practice, much less information than in the worst case.