In this paper a set of student's characteristics that have to be considered in an adaptive and/or personalized programming tutoring system is presented. this set is called *** and includes: knowledge, errors, moti...
详细信息
In this paper a set of student's characteristics that have to be considered in an adaptive and/or personalized programming tutoring system is presented. this set is called *** and includes: knowledge, errors, motivation and cognitive states. It allows the system to identify the variety of backgrounds of prospective learners of programming, their misconceptions, needs and learning pace. the modeling of K.E.M.C.s is performed through a combination of different student modeling techniques: overlay, stereotypes, fuzzy logic and OCC cognitive theory. the gain of this approach is that the particular student model represents a sufficiently large part of the complex dimensions of a real student of programming. therefore, it can be the base for the improvement of the quality of the learning process.
Model transformation is defined as a central concept in model driven engineering. Identifying the transformation rules is nontrivial task, where it might be much easier for the experts to provide examples of the trans...
详细信息
Model transformation is defined as a central concept in model driven engineering. Identifying the transformation rules is nontrivial task, where it might be much easier for the experts to provide examples of the transformations rather than specifying complete and consistent rules. the examples provided by expert represent their knowledge in the domain. thus, it is much beneficial to utilize a set of examples, i.e. pairs of transformation source and target models, in order to learn transformation rules. Machine learning (ML) techniques proved their ability of learning relations and concepts in various domains. In this paper, we aim to apply Inductive logicprogramming (ILP) for learning the transformation rules between the requirements analysis and software design based on a set of pairs of transformation analysis and design models. ALEPH and GILPS systems have been employed, individually, to induce the intended transformation rules; however the resultant rules don't accommodate the desire transformations. thus, in this paper we focus on identifying the problem of analysis-design transformation and discussing the derived rules as well as the limitations of the current ILP systems.
Model transformation is defined as a central concept in model driven *** the transformation rules is nontrivial task,where it might be much easier for the experts to provide examples of the transformations rather than...
详细信息
Model transformation is defined as a central concept in model driven *** the transformation rules is nontrivial task,where it might be much easier for the experts to provide examples of the transformations rather than specifying complete and consistent *** examples provided by expert represent their knowledge in the ***,it is much beneficial to utilize a set of examples,*** of transformation source and target models,in order to learn transformation *** learning(ML) techniques proved their ability of learning relations and concepts in various *** this paper,we aim to apply Inductive logicprogramming(ILP) for learning the transformation rules between the requirements analysis and software design based on a set of pairs of transformation analysis and design *** and GILPS systems have been employed,individually,to induce the intended transformation rules;however the resultant rules don't accommodate the desire ***,in this paper we focus on identifying the problem of analysis-design transformation and discussing the derived rules as well as the limitations of the current ILP systems.
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. the processing order of jobs is the same for each machine. th...
详细信息
ISBN:
(纸本)9781467358149;9781467358125
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. the processing order of jobs is the same for each machine. the time lag is defined as the waiting time between consecutive operations. We use square logic-based Benders decomposition to minimize the total number of tardy jobs with long time horizon defined on the last machine. We combine Mixed Integer Linear programming (MILP) to allocate jobs to time intervals of the time horizon and scheduled using Constraint programming (CP). Also, a lower bound based on Moore's algorithm is developed. then, computational results are reported.
Web services are modular, self-descriptive and loosely coupled applications;they provide a simple programming and deployment model. Besides, they are designed to interact with other services to form larger application...
详细信息
ISBN:
(纸本)9781467358149;9781467358125
Web services are modular, self-descriptive and loosely coupled applications;they provide a simple programming and deployment model. Besides, they are designed to interact with other services to form larger applications. From a software engineering point of view, the construction of new services by composing existing services raises a number of challenges. One of them is the ability to efficiently and effectively select and integrate inter-organizational and heterogeneous services on the Web at runtime. Recently, several formal methods, most of them with a semantics based on transition systems, have been used to guarantee correct service compositions without insisting on its automation. the main goal of this work is to propose a Rewriting logic based framework in order to enhance automatic Web services composition. the proposed model execution allows to discover services automatically and guarantee the correct interaction of independent pieces of software in a transparent manner.
Originally proposed in the mid-90s, design patterns for software development played a key role in objectoriented programming not only in increasing software quality, but also by giving a better understanding of the po...
详细信息
A series of recent papers introduces a coalgebraic semantics for logicprogramming, where the behavior of a goal is represented by a parallel model of computation called coinductive tree. this semantics fails to be co...
详细信息
We propose an approach for single-agent epistemic planning in domains with incomplete knowledge. We argue that on the one hand the integration of epistemic reasoning into planning is useful because it makes the use of...
详细信息
ISBN:
(纸本)9789898565389
We propose an approach for single-agent epistemic planning in domains with incomplete knowledge. We argue that on the one hand the integration of epistemic reasoning into planning is useful because it makes the use of sensors more flexible. On the other hand, defining an epistemic problem description is an error prone task as the epistemic effects of actions are more complex than their usual physical effects. We apply the axioms of the Discrete Event Calculus Knowledge theory (DECKT) as rules to compile simple non-epistemic planning problem descriptions into complex epistemic descriptions. We show how the resulting planning problems are solved by our implemented prototype which is based on Answer Set programming (ASP).
We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work provides semantics for the service overlay by abstracting concepts from logicprogramming. It draws a str...
详细信息
Abduction as reasoning paradigm has been much explored in Artificial Intelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical kn...
详细信息
ISBN:
(纸本)9781614992646;9781614992639
Abduction as reasoning paradigm has been much explored in Artificial Intelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical knowledge based scenarios, about which one can then equate decisions. One reason for this state of affairs is that abduction is difficult to implement efficaciously, even by experts, which entails that abductive systems are not readily available for decision making. Our concept of tabled abduction mitigates this, in the abductive logicprogramming system TABDUAL. the contribution of this paper is three-fold: (1) We discuss some TABDUAL improvements towards its more practical use, particularly in decision making, (2) We show that declarative debugging can be viewed as abduction in logicprogramming, thus showing another potential of abduction for decision making, and (3) We describe how TABDUAL can be applied in decision making and examine its benefit.
暂无评论