A5019186384- Multi-Agent Systems and Negotiation
- Logic, Reasoning, and Knowledge
- Semantic Web and Ontologies
- Logic, programming, and type systems
- Business Process Modeling and Analysis
- Access Control and Trust
- Service-Oriented Architecture and Web Services
- AI-based Problem Solving and Planning
- Advanced Algebra and Logic
- Auction Theory and Applications
- Literary and Cultural Studies
- Educational theories and practices
- Engineering and Information Technology
- Bayesian Modeling and Causal Inference
- Advanced Database Systems and Queries
- Topic Modeling
- Natural Language Processing Techniques
- Business, Education, Mathematics Research
- E-Learning and Knowledge Management
- Business, Innovation, and Economy
- Software Engineering Research
- Advanced Software Engineering Methodologies
- Cultural and political discourse analysis
- Software Engineering Techniques and Practices
- Technology in Education and Healthcare
Universidad Nacional del Sur
2015-2024
Consejo Nacional de Investigaciones Científicas y Técnicas
2013-2024
Centro Científico Tecnológico - Bahía Blanca
2002-2023
Universidad Nacional de Entre Ríos
2017
Centro Científico Tecnológico - San Juan
2012
Universidad Nacional del Santa
2009
Intel (United States)
2007
Comisión de Investigaciones Científicas
2007
Universitat de Lleida
2005
University of North Texas
2000
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of and Argumentation. DeLP provides the possibility representing information in form weak rules declarative manner, defeasible argumentation inference mechanism for warranting entailed conclusions. In an will be used deciding between contradictory goals. Queries supported by arguments could defeated other arguments. A query succeed when there is argument warranted, i.e. ${\mathcal A}$...
The theory of argumentation is a rich, interdisciplinary area research straddling the fields artificial intelligence, philosophy, communication studies, linguistics and psychology. In last few years, significant progress has been made in understanding theoretical properties different logics. However, one major barrier to development practical deployment systems lack shared, agreed notation or ‘interchange format’ for arguments. this paper, we describe draft specification an argument...
In abstract argumentation, each argument is regarded as atomic. There no internal structure to an argument. Also, there specification of what or attack. They are assumed be given. This perspective provides many
The field of computational models argument is emerging as an important aspect artificial intelligence research. reason for this based on the recognition that if we are to develop robust intelligent systems, then it imperative they can handle incomplete and inconsistent information in a way somehow emulates humans tackle such complex task. And one key ways do use argumentation either internally, by evaluating arguments counterarguments, or externally, instance entering into discussion debate...
Argumentation represents a way of reasoning over knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As mechanism, the an argumentation engine reaches these conclusi
Abstract In the last decades, most works in literature have been devoted to study argumentation formalisms that focus on a defeat relation among arguments. Recently, of support between arguments regained attention researchers; bulk research has centered within context abstract by considering as an explicit interaction However, there exist other approaches take into account different setting. This article surveys several interpretations notion proposed literature, such deductive support,...
Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion deciding between them needed. The aim of this paper to investigate an inherent autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast other approaches, we consider not only defeasible, but strict knowledge. Our context-sensitive, i. e., preference...
Defeasible argumentation frameworks have evolved to become a sound setting formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Logic Programming (DeLP) is defeasible formalism based on an extension of logic programming. Although DeLP has been successfully integrated in number different real-world applications, cannot deal with explicit uncertainty, nor vague knowledge, as defeasibility directly encoded the object language. This paper...
Standard approaches to reasoning with description logics (DL) ontologies require them be consistent. However, as are complex entities and sometimes built upon other imported ontologies, inconsistencies can arise. In this article, we present δ-ontologies, a framework for inconsistent DL ontologies. Our proposal involves expressing defeasible logic programs (DeLP). Given query posed w.r.t. an ontology, dialectical analysis will performed on DeLP program obtained from such where all arguments...
Abstract Research on the relation between Belief Revision and Argumentation has always been fruitful in both directions: some argumentation formalisms can be used to define belief change operators, techniques have also for modeling dynamics of beliefs formalisms. In this paper, we give a historical perspective how revision evolved last three decades, it combined with argumentation. First, will recall foundational works concerning links areas. On basis such insights, present conceptual view...