Classical methods for representing and reasoning with knowledge rely on the assumption that the available information is complete, certain and consistent. In real-world problems this is usually not the case, and Al has long dealt with the issue of finding…

The notion of rational agency was proposed by Russell [9] as an alternative characterization of intelligence agency. Loosely speaking, an agent is said to be rational if it perfomns the right actions according to the information it possesses and the…

This work extends the semantics and implementation of fuzzy prolog presented in [VGM02] in order to include Default Knowledge capability. The new semantic allows non-uniform default assumptions and has Closed World Assumption (CWA) and Open World Assumption (OWA) as particular…

One of the key aspects in the design of an architecture for autonomous agents is the way in which beleifs are revised in the face of new information. An intelligent agent must be prepared to handle new information (be it…

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…

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…

Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information.
Within the field of Logic Programming, most of the implementations of Prolog…

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…