In this paper we present a logic programming based framework for the integration of possibly inconsistent databases. In particular we consider the problem of ‘merging’ databases and, since the resulting ‘merged’ d...
详细信息
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe [16], and the complementary system of ...
详细信息
ISBN:
(纸本)158113388X
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe [16], and the complementary system of directional types that has been proposed by Aiken and Lakshman [1]. Our main technical inventions are a new method of deriving more specific types from a given type, which we call pruning, and the notion of the main type from which, using a combination of substitution, subtyping and pruning all types of a predicate can be obtained. We describe a type checking algorithm, and a type reconstruction algorithm which for a given program and a predicate finds its main type. A complexity analysis of these algorithms is provided. In spite of large theoretical complexity bounds these algorithms work quite fast in practice.
In most Multi-Agent Systems (MAS), each agent needs to be designed to negotiate with other agents and to reach a mutual acceptable state where agents can avoid any goal conflicts due to theirs interdependencies upon o...
详细信息
ISBN:
(纸本)9729805024
In most Multi-Agent Systems (MAS), each agent needs to be designed to negotiate with other agents and to reach a mutual acceptable state where agents can avoid any goal conflicts due to theirs interdependencies upon others such as some price conflicts in electronic commerce systems. Many problematic situations, however, may arise such that an agent can meet goal conflicts among agents and cannot possess a complete set of knowledge about others. Negotiation provides a solution to these problems even though agents' knowledge is not complete, and it is also used to allocate tasks or resources in goal inconsistency states. We present a logic programming framework for negotiation in which agents are represented on the basis of three major components: Belief, Desire, and Intention (BDI). Further, we suggest a negotiation mechanism to resolve goal conflicts accompanied with each agent's problem solving activities in cooperative MAS. We implement the proposed negotiation mechanism and test it using a simple example in InterProlog, a Java front-end and functional enhancement for Prolog, based on a variant of FIPA Agent Communication Language (ACL) specification and its interaction protocols.
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are not expressive enough to let one write ...
详细信息
Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abduction with penalization in logic pro...
详细信息
In this paper, we describe the completeness of a calculation procedure of logic programs. The procedure is the combination of two procedures, a replacement procedure of atoms in the goal by the bodiesor the negation o...
详细信息
In this paper, we describe the completeness of a calculation procedure of logic programs. The procedure is the combination of two procedures, a replacement procedure of atoms in the goal by the bodiesor the negation of the bodies of rules in the program, and a transformation procedure of equations to disjunctivenormal forms (DNF) equivalent under dark's EquationalTheory (CET). To combine replacement of atoms in the goal to logicalformulae determined from the program and transformation of equations to DNF equivalent under CET is a method by whichprocedures with the capability of expressing answers in DNFcan be build, so it is a leading method for expressing answers in a formincluding negation. Some procedures based on the method are devised, and their calculation capabilities are shown by applying thetheory of completed programs. However, the procedure that uses the bodies or the negation of thebodies of rules for replacement has higher calculationcapability, and is intuitively more natural than they. Therefore, to clarify the calculation capability of theprocedure is considered an important subject for researchinto calculation procedures of logic programs with thecapability for expressing answers in a form includingnegation. Moreover, since the completeness is realized by standing on theviewpoint of treating the implication symbol as a differentimplication symbol from usual, and interpreting logic programs in three-valued logic, examples which support the viewpoint are also described.
One lesson learned from practical constraint solving applications is that constraints are often heterogeneous. Solving such constraints requires a collaboration of constraint solvers. In this paper, we introduce a met...
详细信息
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available in Mercury programs, that allows the...
详细信息
In this paper we investigate the relationship between Disjunctive logic programming and a subset of Linear logic, namely the fragment of LinLog which corresponds to Andreoli and Pareschi's LO. We analyze the two l...
详细信息
暂无评论