Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Abstract. In this paper we propose a new approach to improve electronic editions of literary corpus, providing an efficient estimation of manuscripts pages structure. In any handwr...