Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
We present in this paper an approach to assessing student paraphrases in the intelligent tutoring system iSTART. The approach is based on measuring the semantic similarity between ...
Vasile Rus, Mihai C. Lintean, Arthur C. Graesser, ...
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
Multi-agent systems where the members are developed by parties with competing interests, and where there is no access to a member’s internal state, are often classified as ‘o...