This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper develops a novel constraintbased action language, BMAP, that enables the declarative description of large classes of multi-agent and multi-valued domains. BMAP supports several complex features, including combined effe...

We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and prove that it is refutation complete for many-valued CNF formulas and, moreover, enforces CSP (i, j)-consistency when applied to a many-valued SAT encoding of a CSP. Instances of our rule enforce well-known local consiste...

This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...

In this paper, we generalize properties for single-valued functions in homotopy theory to multi-valued functions. We present new definitions such as locally m-pathwise connected, m-simply m-covering space, and regular space. apply some topological from algebraic topology the