In omplete information is a problem in many aspe ts of a tual environments. Further- more, in many s enarios the knowledge is not represented in a risp way. It is ommon to nd fuzzy on epts or problems with…

Lawyers often need to look for previous similar legal cases when analysing new ones.
The more previous cases, the more time is spent. Classical search engines execute termbased retrieval, which may miss relevant documents as well as fetch several irrelevant…

Knowledge-intensive processes are widely used to recover from errors, handle exceptional cases and complaints, and to improve or adapt a process itself. In this context, evolved Business-Process Reengineering (BPR) techniques are changing to give some answers to this reality. In…

Software tools processing partially common set of data should share an understanding of what these data mean. Since ontologies have been used to express formally a shared understanding of information, we argue that they can be used to improve integration…

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…

Defeasible Logic Programming (DeLP) is a suitable tool for knowledge representation and reasoning. Its operational semantics is based on a dialectical analysis where arguments for and against a literal interact in order to determine whether this literal is believed by…

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…