The Experts below are selected from a list of 729 Experts worldwide ranked by ideXlab platform

Philippe David - One of the best experts on this subject based on the ideXlab platform.

  • Using pivot consistency to decompose and solve functional CSPS
    Journal of Artificial Intelligence Research, 1995
    Co-Authors: Philippe David
    Abstract:

    Many studies have been carried out in order to increase the search efficiency of constraint satisfaction problems; among them, some make use of structural properties of the constraint network; others take into account semantic properties of the constraints, generally assuming that all the constraints possess the given property. In this paper, we propose a new decomposition method benefiting from both semantic properties of functional constraints (not bijective constraints) and structural properties of the network; furthermore, not all the constraints need to be functional. We show that under some conditions, the existence of solutions can be guaranteed. We first characterize a particular subset of the variables, which we name a root set. We then introduce pivot consistency, a new local consistency which is a weak form of path consistency and can be achieved in O(n2d2 complexity (instead of O(n3d3) for path consistency), and we present associated properties; in particular, we show that any Consistent Instantiation of the root set can be linearly extended to a solution, which leads to the presentation of the aforementioned new method for solving by decomposing functional CSPs.

  • Using pivot consistency to decompose and solve functional CSPs
    Journal of Artificial Intelligence Research, 1995
    Co-Authors: Philippe David
    Abstract:

    Many studies have been carried out in order to increase the search efficiency of constraint satisfaction problems; among them, some make use of {\em structural} properties of the constraint network; others take into account {\em semantic} properties of the constraints, generally assuming that {\em all} the constraints possess the given property. In this paper, we propose a new decomposition method benefiting from both semantic properties of {\em functional} constraints (not {\em bijective} constraints) and structural properties of the network; furthermore, not all the constraints need to be functional. We show that under some conditions, the existence of solutions can be guaranteed. We first characterize a particular subset of the variables, which we name a {\em root set}. We then introduce {\em pivot consistency}, a new local consistency which is a we ak form of path consistency and can be achieved in $O(n^2d^2)$ complexity (instead of $O(n^3d^3)$ for path consistency), and we present associated properti es; in particular, we show that any Consistent Instantiation of the root set can be linearly extended to a solution, which leads to the presentation of the aforementioned new method for solving by decomposing functional {\sc csp}s.

Insu Song - One of the best experts on this subject based on the ideXlab platform.

  • STAIRS - A Compact Argumentation System for Agent System Specification
    2006
    Co-Authors: Insu Song, Guido Governatori
    Abstract:

    We present a non-monotonic logic tailored for specifying compact autonomous agent systems. The language is a Consistent Instantiation of a logic based argumentation system extended with Brooks' subsumption concept and varying degree of belief. Particulary, we present a practical implementation of the language by developing a meta-encoding method that translates logical specifications into compact general logic programs. The language allows n-ary predicate literals with the usual first-order term definitions. We show that the space complexity of the resulting general logic program is linear to the size of the original theory.

  • Designing agent chips
    ACM Press, 2006
    Co-Authors: Insu Song
    Abstract:

    reproduced in whole or in part, by photocopy or other means, without the permission of the author. This thesis provides a new approach to designing smart electronic chips called agent chips. It pro-vides a layered argumentation system for specifying smart systems and an automated method for synthesizing smart electronic chips from an agent specification in the layered argumentation sys-tem. The layered argumentation system is a Consistent Instantiation of a logic based argumentation system extended with Brooks ’ subsumption concept, varying degrees of confidence, and fuzzy op-erators. The layered argumentation system provides a conceptual and behavioral decomposition of smart systems into varying degrees of confidence or competence. Particularly, the thesis provides a new method of compiling the layered argumentation system into hardware description formats, such as RTL-VHDL (Register Transfer Level–VLSI Hardware Description Language) or RTL-Verilog, which is synthesized using computer-assisted tools to develop ASIC (Application Specific Integrated Circuits) masks or FPGA (Field Programmable Gate Arrays) configurations. To prevent abnormal behaviors that can be caused by loops in the theories of layered argumentation system, it provide

Klaus Simon - One of the best experts on this subject based on the ideXlab platform.

  • CP - Using Blocks for Constraint Satisfaction
    Principles and Practice of Constraint Programming — CP98, 1998
    Co-Authors: Bernhard Seybold, Felix J. Metzger, Gül Ogan, Klaus Simon
    Abstract:

    The assembly problem is the spatial joining of separate rigid bodies within a CAD/CAM-system. The solution to the assembly does not only need to contain one Consistent Instantiation, but also qualitative information. In particular, this covers the localization of redundancy and remaining degrees of freedom in the mechanism. Although it is natural to model the assembly as a constraint satisfaction problem (CSP), solving remains a difficult task

Guido Governatori - One of the best experts on this subject based on the ideXlab platform.

  • STAIRS - A Compact Argumentation System for Agent System Specification
    2006
    Co-Authors: Insu Song, Guido Governatori
    Abstract:

    We present a non-monotonic logic tailored for specifying compact autonomous agent systems. The language is a Consistent Instantiation of a logic based argumentation system extended with Brooks' subsumption concept and varying degree of belief. Particulary, we present a practical implementation of the language by developing a meta-encoding method that translates logical specifications into compact general logic programs. The language allows n-ary predicate literals with the usual first-order term definitions. We show that the space complexity of the resulting general logic program is linear to the size of the original theory.

Governatori Guido - One of the best experts on this subject based on the ideXlab platform.

  • A compact argumentation system for agent system specification
    IOS Press, 2006
    Co-Authors: Song Insu, Governatori Guido
    Abstract:

    We present a non-monotonic logic tailored for specifying compact autonomous agent systems. The language is a Consistent Instantiation of a logic based argumentation system extended with Brooks' subsumption concept and varying degree of belief. Particulary, we present a practical implementation of the language by developing a meta-encoding method that translates logical specifications into compact general logic programs. The language allows n-ary predicate literals with the usual first-order term definitions. We show that the space complexity of the resulting general logic program is linear to the size of the original theory