Multi-SLD resolution is a variant of SLD resolution based on a simple idea: Let the allowed constraints be closed under disjunction, and provide a mechanism for collecting solutions to a goal and turning the solutions into a disjunctive constraint. This idea leads to an operational model of logic programming, called data or-parallelism, in which multiple constraint environments partially replac...

the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

This paper presents an algorithm based on multi-objective approach for network reconfiguration. Multiple objectives are considered for reduction in the system power loss, deviations of the nodes voltage and transformers loading imbalance, while subject to a radial network structure in which all the loads must be energized and no branch current constraint is violated. These three objectives are ...

Since wireless mesh networks are ad-hoc in nature, many routing protocols used for ad-hoc networks like AODV are also used for wireless mesh networks by considering only the shortest route to destination. Since data transfer in wireless mesh networks is to and from the AP, these protocols lead to congested routes and overloaded APs. To reduce congestion, the routing protocols such as traffic ba...

Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) rules. In this paper we prove that multiple heads augment the expressive power of the language. In fact, we first show that restricting to single head rules affects the Turing completeness of CHR, provided that the underlying sig...

In distributed multi-agent environments, several problems relating to the co-ordination of agent tasks can be modeled as constraint satisfaction problems. There have been several approaches that have addressed constraint-satisfaction problems [42] in distributed multi-agent environments. The ERA formulation [20] is a new strategy that models the constraint-satisfaction problem as Agents with Re...

This article proposes a framework to model and reason on what we call multi-calendar appointment scheduling problems. Multicalendar appointment scheduling problems such as planning a phone conference of three persons in France, Tunisia, and Japan refer to various temporal conditions, involving arbitrary calendric types such as months (Islamic months are defined differently from Gregorian months...

`Constraint hierarchy' is a nonmonotonic system that allows programmers to describe over-constrained real-world problems by specifying constraints with hierarchical preferences, and has been applied to various areas. An important aspect of constraint hierarchies is the existence of e cient satisfaction algorithms based on local propagation. However, past local-propagation algorithms have been l...

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon becomes intractable for even a moderate number of robots. Decentralised approaches, such as priority planning, are much faster but lack completeness. Previous work has demonstrated that the search can be significantly ...