Skip to search formSkip to main contentSkip to account menu

Declarative and procedural goals in intelligent agent systems

This paper presents a high-level plan notation with goals and gives its formal semantics, and shows how the use of declarative information permits reasoning to be performed on goals.

Declarative & Procedural Goals in Intelligent Agent Systems

This paper presents a high-level plan notation with goals and gives its formal semantics, and shows how the use of declarative information permits reasoning to be performed on goals.

Evaluating the quality of interaction in asynchronous discussion forums in fully online courses

This article conducted research on the quality of discussion in fully online courses through analysis of discussion forum activities on two large fully online subjects for computing students over two consecutive semesters and used a grounded theoretic approach for data analysis.
View on Taylor & Francis (opens in a new tab)

Simplifying the Development of Intelligent Agents

This paper identifies the concept set which has been found to be important in developing intelligent agent systems and the relationships between these concepts and describes briefly a (very simplified) example from one of the projects the authors have worked on (RoboRescue), illustrating the way in which these concepts are important in designing and developing intelligent software agents.
View via Publisher (opens in a new tab)

Evaluating the dynamic behaviour of Python applications

It is found that while most dynamic activity occurs during program startup, dynamic activity after startup cannot be discounted entirely.
View Paper (opens in a new tab)

An operational semantics for the goal life-cycle in BDI agents

This work develops a detailed description of goal states, and a comprehensive suite of operations that may be applied to goals (including dropping, aborting, suspending and resuming them), and provides an operational semantics corresponding to this detailed description in an abstract agent language (CAN).
View on Springer (opens in a new tab)

Implementing the Linear Logic Programming Language Lygon

This paper investigates the implementation of Lygon, Girard's linear logic, and presents solutions to two problems that arise, the division of resources between sub-branches of the proof and the selection of the formula to be decomposed.
View via Publisher (opens in a new tab)

Exploring programming assessment instruments: a classification scheme for examination questions

The development of a classification scheme that can be used to investigate the characteristics of introductory programming examinations is described and a taste of the results of a pilot analysis of a set of CS1 exam papers is presented.
View on ACM (opens in a new tab)

The Uniform Proof-Theoretic Foundation of Linear Logic Programming

A translation of the intuitionistic hereditary Harrop formulae and intuitionistic uniform proofs of Girard's linear logic are considered, and it is shown that certain properties are preserved under this translation.

How active are students in online discussion forums

This research provides a benchmark for the trend of participation expected of the fully online introductory information technology and programming students and shows that there is a correlation between activity of students in online forums and the grades they achieve.
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)