Papers by Marcelo Falappa
XVI Workshop de Investigadores en Ciencias de la Computación, Oct 23, 2014
III Congreso Argentino de Ciencias de la Computación, 1997
6th IJCAI Workshop on Knowledge and Reasoning in Practical Dialogue Systems, Jul 12, 2009
We present an Abstract Dialogue Framework which provides an environment for studying the behavior... more We present an Abstract Dialogue Framework which provides an environment for studying the behavior of collaborative dialogue systems in terms of abstract relevance notions, together with three Collaborative Semantics each of which defines a different collaborative behavior of the dialogues under the framework. One of these semantics describes an utopian, non practical, behavior which is approximated in different ways by the other two constructive semantics. Complete examples are provided in Propositional Logic ...
X Congreso Argentino de Ciencias de la Computación, 2004
Time and change are notions that seems unavoidable in some areas of work and investigation, langu... more Time and change are notions that seems unavoidable in some areas of work and investigation, languages that can deal with these notions are necessary. At the same time, methods for a proper time handling are quite complex, mainly because problem's complexity and variety of solutions. Between the languages developed to cover these expectations, under a specific view of time, are [Cobo and Augusto, 1999a] EMTLP and a metric temporal logic's fragment, bounded universal Horn formulae analyzed by Brzoska . Although both of them performed metric temporal programming, they face this fact from different perspectives. In this work we are going to try a comparison between them after a short overview over each. In this first stage we present a way of representing EMTPL's in first order logic using Brzoska's approximation as a bridge, and we also compare some aspects of both programming languages.
IX Congreso Argentino de Ciencias de la Computación, Oct 1, 2003
XXII Congreso Argentino de Ciencias de la Computación (CACIC 2016)., 2016
Resumen Con el avance de las tecnologías de la informacion se hace cada vez más facil generar y p... more Resumen Con el avance de las tecnologías de la informacion se hace cada vez más facil generar y procesar datos con mayor precision acerca de lo que ocurre en un dominio complejo. Las aplicaciones que se desen vuelven en estos entornos se caracterizan por recibir grandes cantidades de datos en poco tiempo, con altas tasas de cambio, como así tambien in certidumbre e incompletitud; a este tipo de torrente de datos -que no se puede almacenar para ser procesado mas adelante -se los conoce con el nombre de "flujos" . En este trabajo presentamos una propuesta para rea lizar procesamiento de flujos de manera inteligente a traves de sistemas argumentativos, proponiendo una combinacion novedosa de (i) tecnicas de procesamiento de flujos de datos y eventos complejos, (ii) herramien tas de argumentacion estructurada, (iii) razonamiento probabilístico y (iv) operadores de revisioín de creencias. Palabras clave: Procesamiento de flujo de datos, Argumentaciín Es tructurada, Razonamiento bajo incertidumbre, Revision de creencias.
XII Congreso Argentino de Ciencias de la Computación, Oct 1, 2006
In order to deal with the Ontology Change problem and considering an environment where Descriptio... more In order to deal with the Ontology Change problem and considering an environment where Description Logics (DLs) are used to describe ontologies, the question of how to integrate distributed ontologies appears to be in touch with Belief Revision since DL terminologies may define same concept descriptions of a not necessarily same world model. A possible alternative to reason about these concepts is to generate unique concept descriptions in a different terminology. This new terminology needs to be consistently created, trying to deal with the minimal change problem, and moreover, yielding a non-monotonic layer to express ontological knowledge in order to be further updated with new distributed ontologies.
XX Workshop de Investigadores en Ciencias de la Computación (WICC 2018, Universidad Nacional del Nordeste)., 2018
V Workshop de Investigadores en Ciencias de la Computación, 2003
@cs.uns.edu.ar Resumen Uno de los aspectos que no ha sido considerado en forma profunda en el áre... more @cs.uns.edu.ar Resumen Uno de los aspectos que no ha sido considerado en forma profunda en el área de revisión de creencias es el de la información temporal. La mayoría de los formalismos de revisión de creencias utilizan un lenguaje proposicional, sin contar con operadores modales con referencias temporales. Esto representa una limitación importante puesto que el tiempo es un factor determinante para la toma de decisiones sobre todo en algunos formalismos, aquellos en los cuales pueda modificarse la información y adquiere relevancia cuando se produce esa modificación. En este trabajo brindaremos la base para el futuro desarrollo de un sistema con bases de información temporales dinámicos, en los cuales la representación del tiempo es adoptada en la forma de operadores modales temporales.
Local Belief Dynamics in Network Knowledge Bases
ACM Transactions on Computational Logic, 2022
People are becoming increasingly more connected to each other as social networks continue to grow... more People are becoming increasingly more connected to each other as social networks continue to grow both in number and variety, and this is true for autonomous software agents as well. Taking them as a collection, such social platforms can be seen as one complex network with many different types of relations, different degrees of strength for each relation, and a wide range of information on each node. In this context, social media posts made by users are reflections of the content of their own individual (or local) knowledge bases; modeling how knowledge flows over the network—or how this can possibly occur—is therefore of great interest from a knowledge representation and reasoning perspective. In this article, we provide a formal introduction to the network knowledge base model, and then focus on the problem of how a single agent’s knowledge base changes when exposed to a stream of news items coming from other members of the network. We do so by taking the classical belief revision...
Ontology evaluation is an important issue that must be addressed during the lifecycle of an ontol... more Ontology evaluation is an important issue that must be addressed during the lifecycle of an ontology because it assures that the ontology reflects the desired requirements during selection, design, population, evolution, usage, or other processes of the ontology lifecycle. Ontology evaluation aims at assessing the quality and the adequacy of an ontology from the point of view of a particular predefined criterion, for use in a specific context, for a specific purpose. Here, we demonstrate that evaluation is an important issue for ontology evolution. To capture the different nature of evaluation and evolution criteria, we use a tool (S-OntoEval) aiming at assessing ontology quality by implementing existing quality metrics that draw upon semiotic theory. An evaluation of the SWIntO ontology of the SmartWeb project shows its controlled evolution by quality measurement and improvement.
VIII Workshop de Investigadores en Ciencias de la Computación, 2006
Esta línea de investigación tiene como objetivo analizar el intercambio de conocimiento en sistem... more Esta línea de investigación tiene como objetivo analizar el intercambio de conocimiento en sistemas multi-agente utilizando áreas de conocimiento compartidas. El proyecto involucra la extensión del modelo Linda, agregando nuevas características a nivel de modelo. En este trabajo se plantea la idea de espacios de tuplas distribuidos, brindando la posibilidad de coexistir diferentes espacios de tuplas con características distintas, residiendo en áreas de memorias remotas.
arXiv (Cornell University), Jan 7, 2014
In real-world applications, knowledge bases consisting of all the information at hand for a speci... more In real-world applications, knowledge bases consisting of all the information at hand for a specific domain, along with the current state of affairs, are bound to contain contradictory data coming from different sources, as well as data with varying degrees of uncertainty attached. Likewise, an important aspect of the effort associated with maintaining knowledge bases is deciding what information is no longer useful; pieces of information (such as intelligence reports) may be outdated, may come from sources that have recently been discovered to be of low quality, or abundant evidence may be available that contradicts them. In this paper, we propose a probabilistic structured argumentation framework that arises from the extension of Presumptive Defeasible Logic Programming (PreDeLP) with probabilistic models, and argue that this formalism is capable of addressing the basic issues of handling contradictory and uncertain data. Then, to address the last issue, we focus on the study of non-prioritized belief revision operations over probabilistic Pre-DeLP programs. We propose a set of rationality postulates -based on well-known ones developed for classical knowledge bases -that characterize how such operations should behave, and study a class of operators along with theoretical relationships with the proposed postulates, including a representation theorem stating the equivalence between this class and the class of operators characterized by the postulates.
XIV Congreso Argentino de Ciencias de la Computación, 2008
In this article we present a generalized dynamic argumentation framework that handles arguments e... more In this article we present a generalized dynamic argumentation framework that handles arguments expressed in an abstract language assumed to be some first order logic fragment. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics is proposed as a consistency restoration tool to cope with the ontology debugging.
XIII Congreso Argentino de Ciencias de la Computación, 2007
The theory change area have defined several operators trying to model the dynamic of knowledge. T... more The theory change area have defined several operators trying to model the dynamic of knowledge. The goal of this work is to introduce a preprocessor of perceptions that could be part of an agent. The purpose of the preprocessor is to select an adequate change operator to store the perceptions that the agent perceives from the environment where their activities are performed. An agent receives perceptions, and classifies them according to how they were obtained by him/her. Once are the perceptions classified, the preprocessor selects one of the change operators to store the new information in the belief base. Then the preprocessor of perceptions sends the selected method and the perceptions to a change machine in the agent. When the change machine receives the mentioned inputs, it interacts with the belief base of the agent to store the new information.
XVIII Workshop de Investigadores en Ciencias de la Computación (WICC 2016, Entre Ríos, Argentina), May 23, 2016
XIII Congreso Argentino de Ciencias de la Computación, 2007
When using tableaux algorithms to reason about Description Logics (DLs), new information is infer... more When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization to express knowledge bases in the web, and the integration of distributed ontologies is developed under new extensions of the belief revision theories originally exposed in . Hence, a reinforced theory arises in order to properly apply change operations over models, considering new inferred information and assumed beliefs in each possible world. As a result, a new type of contraction operator is proposed and its success postulate analyzed.
X Congreso Argentino de Ciencias de la Computación, 2004
Esta optimización consiste en unir aquellos diferentes subesquemas obtenidos por los algoritmos d... more Esta optimización consiste en unir aquellos diferentes subesquemas obtenidos por los algoritmos de descomposición tradicionales, obteniendo menos subesquemas, y por ende, probablemente menos reiteración de atributos. Esta optimización tiene la característica de preservar las propiedades de preservación de dependencias (en 3FN) y join sin pérdida (lossless join) a un bajo costo computacional ya que debe tomar los diferentes subesquemas compuestos por unos pocos atributos.
VIII Workshop de Investigadores en Ciencias de la Computación, 2006
Distributed ontologies expressed as description logics may define repeated information. To reason... more Distributed ontologies expressed as description logics may define repeated information. To reason about concepts that these ontologies express, a possible option is to generate unique concept definitions in a different terminology or TBox. The creation of a new terminology from different ontologies need to be consistent, and expressed with non-monotonic logics to be further updated with new distributed ontologies. The model AGM of theory change seems to be an interesting framework to be studied in conjunction with description logics and generate a new non-monotonic description logics model.
IX Congreso Argentino de Ciencias de la Computación, Oct 1, 2003
Knowledge representation models are very important in the design of intelligent agents because th... more Knowledge representation models are very important in the design of intelligent agents because they provide with mechanisms to manage beliefs and their dynamics. In this paper, we propose the use of AnsProlog* as a knowledge representation language, and develop a Non Prioritized Belief Revision operator based on the Answer Set semantics and the use of explanations. This operator is suitable for multiagent environments, in which agents can exchange information by having dialogues which explain their respective beliefs. A simple, yet complete example follows the presentation of this operator.
Uploads
Papers by Marcelo Falappa