Frequently we become amazed with the increasing number of problems to be solved that fiourish while facing daily activities. Often, related to these problems we llave also an incredible amount oí data. Since we cannot allways afford time and resources…

The notion of context and its importance in knowledge representation and nonmonotonic reasoning was first discussed in Artificial Intelligence by John McCarthy.
Ever since, contexts have found many applications in developing knowledge-based reasoning systems.
Defeasible argumentation has gained wide acceptance…

The problem of speeding up ínference has proved to be important in argumentative systems. When computing dialectical structures, several paths are searched (called argumentation lines), many of which will eventually prove useless. Morover, the performance of backward chainers degrades quickly…

The matrix connection method (MCM) is an alternative procedure for theorem proving than the usual resolution technique. We already have used the MCM for finding models in a real-time knowledge-based system generator. In this paper, we adapt the MCM to…

In this study we propose the standard modal logic KD43 as the logle governing expressions about Utopia. We define a formal construction corresponding to Utopian expressions In ordlnary language that we name utopian eonditionals.
They possess the singular properties of…

In this work we analyze the problem of incorporating specificity to characterize defeat in a particular argumentative framework, called observation based defeasible logic programming (ODeLP) [1]. Eficiency is an important issues in ODeLP, since this framework has been de ned…

A solution of problems in multiagent systems involves representing beliefs of agents immersed in dynamic environments. Observation-based Defeasible Logic Programming (ODeLP) is an argument-based logic programming language that is used to represent an agent’s knowledge in the context of a…

Parallel machine scheduling, involves the allocation of jobs to the system resources (a bank of machines in parallel). A basic model consisting of m machines and n jobs is the foundation of more complex models. Here, jobs are allocated according…

Little has been written about the component provision problem (programming plans and domain concepts) for the repositories of knowledge in program understanding systems and reports that specifically address this issue are unknown. Model-driven and plan-driven approaches use repositories where construction…

In this paper, we build on previous work on Belief Revision operators based on the use of logic programming with Answer Set semantics as a representation language. We present a set of postulates for Answer Set Revision with respect to…