This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the first semantics, ...
详细信息
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is propos...
详细信息
The use of the Internet raises serious behavioural issues regarding, for example, security and the interaction among agents that may travel across links. Model-building such interactive systems is one of the biggest c...
详细信息
In workflow systems or other applications, users need more semantic information. Ontologies and semantic Web are important technologies for managing semantic information. Our work is focused on semantic spatial inform...
详细信息
In workflow systems or other applications, users need more semantic information. Ontologies and semantic Web are important technologies for managing semantic information. Our work is focused on semantic spatial information in distributed workflow. The spatial relations was described by Description Logic, the ontologies was then constructed using the RDF Schemas and OWL Capabilities. These theories and methods are enclosed in a middleware, and the middleware was embedded in workflow system of the government in Jilin Province.
Q-learning is an effective model-free reinforcement learning algorithm. However, Q-learning is centralized and competent only for single agent learning but not multi-agent learning because in later case the size of st...
详细信息
Q-learning is an effective model-free reinforcement learning algorithm. However, Q-learning is centralized and competent only for single agent learning but not multi-agent learning because in later case the size of state-action space is huge and will grow exponentially with the number of agents increasing. In the paper we present a distributed Q-learning algorithm to solving this problem. In our algorithm, the tasks of learning optimal action policy are distributed to each agent in team but not a central agent. In order to reduce the size of action-state space of multi-agent team we introduce a state-action space sharing strategy of agent team, through which one agent in team can use the states already explored by other agents before and need not take time to explore these states again. Additionally, our algorithm has the ability to allocate sub-goals dynamically among agents according to environment changing, which can make agent team coordinate more efficiently. Experiments show the efficiency of our algorithm when it is applied to the benchmark problem of predator-prey pursuit game, also called pursuit game, in which a team of predators coordinate to capture a prey.
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with...
详细信息
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with hard constraints into one constraint hierarchy, therefore one could process preferences and constraints in a single formalism with fruitful constraint solving algorithms. Furthermore, illustrates it with some examples, proves that the transformation preserves the ceteris paribus property and presents some complexity results. Finally compares it with related work and concludes the paper.
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we ana...
详细信息
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint *** designed a generic dynamic constraint solving algorithm for solving the scheduling *** give an example of its application to semi on-line discrete resource-constrained scheduling problem(ship-loading problem).
In UML, a modeling language popularly used to describe models at different abstraction levels, sequence diagram and statechart are both used to represent systems' behavior models. A consistency problem may arise d...
详细信息
In UML, a modeling language popularly used to describe models at different abstraction levels, sequence diagram and statechart are both used to represent systems' behavior models. A consistency problem may arise due to the fact that sequence diagram represent interactive behavior of all objects, whereas statechart represent the complete behavior of one specific object. This paper proposes an approach checking the consistency between sequence diagrams and state diagrams. In our approach, statechart is formalized using finite state processes and sequence diagram is represented using messages trace. An existing tool LTSA is used to support our method.
The workflow model is the abstract expression of the workflow or the business process. Following the WfMC reference model, a PKI-based lightweight workflow model named as PBLW is put forward in this paper. The framewo...
详细信息
The workflow model is the abstract expression of the workflow or the business process. Following the WfMC reference model, a PKI-based lightweight workflow model named as PBLW is put forward in this paper. The framework of PBLW is proposed. Based on the time constraint directed graph, the workflow theory model in formalization is described in detail, and the time constraint problems are discussed in order to enhance the time management ability of the workflow model. Furthermore, in order to express the complicated secure access control constraint of the workflow, a conditioned RBAC model based on PKJ technology is presented, according to the traditional RBAC security access control model. Finally, the workflow engine driven algorithms for the workflow instance are given. By the actual inspection and users' feedback, it proves that this model can express the basic requirements of a majority of the process applications.
暂无评论