Doctor of Science, Washington University, Lic. en Matemática, U. Nac. del Sur. Chair LIDIA (AI Lab)Full Professor of Artificial Intelligence and Logic in Computer Science Dept. of Computer Science and Engineering, Universidad Nacional del Sur.Research interests: Knowledge Representation and Reasoning Computational, Logic, Logic Programming, Defeasible Reasoning, Belief Revision, Argumentation, Deliberate Systems, Autonomous Agents, Multi-Agent Systems.
Fue en 1956 cuando la "Dartmouth Summer Conference on Artificial Intelligence" acuñó el... more Fue en 1956 cuando la "Dartmouth Summer Conference on Artificial Intelligence" acuñó el término "Inteligencia Artificial". En esta conferencia se dieron cita un conjunto de investigadores interesados en la conjetura de que "todos los aspectos del aprendizaje o cualquier otra característica de la inteligencia pueden describirse en principio con tanta precisión como para hacer que una máquina los simule". Aún hoy día resulta interesante leer la propuesta original de esta reunión, que puede encontrarse en la página Web personal de John McCarthy, uno de ...
In this paper we present the DAQAP, a Web platform for Defeasible Argumentation Query Answering, ... more In this paper we present the DAQAP, a Web platform for Defeasible Argumentation Query Answering, which offers a visual interface that facilitates the analysis of the argumentative process defined in the Defeasible Logic Programming (DeLP) formalism. The tool presents graphs that show the interaction of the arguments generated from a DeLP program; this is done in two different ways: the first focuses on the structures obtained from the DeLP program, while the second presents the defeat relationships from the point of view of abstract argumentation frameworks, with the possibility of calculating the extensions using Dung’s semantics. Using all this data, the platform provides support for answering queries regarding the states of literals of the input program.
We present a novel activating approach to Argument Theory Change (ATC) for the study of the dynam... more We present a novel activating approach to Argument Theory Change (ATC) for the study of the dynamics of the judicial process. ATC applies belief change concepts to dialectical argumentation for altering trees upon which the semantics for reasoning are defined. The activating approach to ATC considers the incorporation of arguments to define a revision operator for studying how to provoke change to the semantics’ outcome. Our objective is to contribute to the discussion of how to deal with circumstances of the judicial process like hypothetical reasoning for conducting investigations of a legal case, and for handling the dynamics of the judicial process. We finally observe the behavior of our proposal upon the sentences of two different real criminal procedures.
IV Congreso Argentina de Ciencias de la Computación, Nov 1, 1998
Desde comienzos de la década de los' 80 han aparecido un número significativo de for... more Desde comienzos de la década de los' 80 han aparecido un número significativo de formalismos que modelan, en ciertos aspéctos, el razonamiento de sentido común. El esfuerzo fué orientado a definir una clase de razonamiento que admitiese información incompleta y potencialmente inconsistente, fundamentalmente motivado por la intuición de que esta parece ser una característica distintiva de las decisiones tomadas por un agente inteligente. La plétora de sistemas ha generado un interés creciente por lograr criterios ...
Defeasible Logic Programming (DeLP) is an argumentation-based reasoning tool that allows users to... more Defeasible Logic Programming (DeLP) is an argumentation-based reasoning tool that allows users to contemplate reasons for and against certain conclusions---the warrant status of literals in the knowledge base is the main output of this dialectical process. Since the computation of these warrant statuses is a costly endeavor, any update to the knowledge base has a huge impact if carried out naively. In this paper, we study the case of updates consisting only of additions of either strict or defeasible rules, identifying conditions under which we can avoid wasted effort and proposing a data structure to keep track of which literals' warrant status can potentially be affected by a given update. We report the results of a preliminary set of experiments showing that our incremental algorithm affords significantly lower running times in practice.
Fue en 1956 cuando la "Dartmouth Summer Conference on Artificial Intelligence" acuñó el... more Fue en 1956 cuando la "Dartmouth Summer Conference on Artificial Intelligence" acuñó el término "Inteligencia Artificial". En esta conferencia se dieron cita un conjunto de investigadores interesados en la conjetura de que "todos los aspectos del aprendizaje o cualquier otra característica de la inteligencia pueden describirse en principio con tanta precisión como para hacer que una máquina los simule". Aún hoy día resulta interesante leer la propuesta original de esta reunión, que puede encontrarse en la página Web personal de John McCarthy, uno de ...
In this paper we present the DAQAP, a Web platform for Defeasible Argumentation Query Answering, ... more In this paper we present the DAQAP, a Web platform for Defeasible Argumentation Query Answering, which offers a visual interface that facilitates the analysis of the argumentative process defined in the Defeasible Logic Programming (DeLP) formalism. The tool presents graphs that show the interaction of the arguments generated from a DeLP program; this is done in two different ways: the first focuses on the structures obtained from the DeLP program, while the second presents the defeat relationships from the point of view of abstract argumentation frameworks, with the possibility of calculating the extensions using Dung’s semantics. Using all this data, the platform provides support for answering queries regarding the states of literals of the input program.
We present a novel activating approach to Argument Theory Change (ATC) for the study of the dynam... more We present a novel activating approach to Argument Theory Change (ATC) for the study of the dynamics of the judicial process. ATC applies belief change concepts to dialectical argumentation for altering trees upon which the semantics for reasoning are defined. The activating approach to ATC considers the incorporation of arguments to define a revision operator for studying how to provoke change to the semantics’ outcome. Our objective is to contribute to the discussion of how to deal with circumstances of the judicial process like hypothetical reasoning for conducting investigations of a legal case, and for handling the dynamics of the judicial process. We finally observe the behavior of our proposal upon the sentences of two different real criminal procedures.
IV Congreso Argentina de Ciencias de la Computación, Nov 1, 1998
Desde comienzos de la década de los' 80 han aparecido un número significativo de for... more Desde comienzos de la década de los' 80 han aparecido un número significativo de formalismos que modelan, en ciertos aspéctos, el razonamiento de sentido común. El esfuerzo fué orientado a definir una clase de razonamiento que admitiese información incompleta y potencialmente inconsistente, fundamentalmente motivado por la intuición de que esta parece ser una característica distintiva de las decisiones tomadas por un agente inteligente. La plétora de sistemas ha generado un interés creciente por lograr criterios ...
Defeasible Logic Programming (DeLP) is an argumentation-based reasoning tool that allows users to... more Defeasible Logic Programming (DeLP) is an argumentation-based reasoning tool that allows users to contemplate reasons for and against certain conclusions---the warrant status of literals in the knowledge base is the main output of this dialectical process. Since the computation of these warrant statuses is a costly endeavor, any update to the knowledge base has a huge impact if carried out naively. In this paper, we study the case of updates consisting only of additions of either strict or defeasible rules, identifying conditions under which we can avoid wasted effort and proposing a data structure to keep track of which literals' warrant status can potentially be affected by a given update. We report the results of a preliminary set of experiments showing that our incremental algorithm affords significantly lower running times in practice.
Uploads
Papers by Guillermo R. Simari