1179 search results - page 215 / 236 » Programming in Hybrid Constraint Languages |
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Intelligent Tutoring Systems (ITSs) have proved useful in a variety of domains, but are notoriously resource intensive to build. We have created two programs (ātutor generatorsā...
PLANX
2007
13 years 9 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
SEBD
2001
13 years 9 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantiļ¬ed Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
CP
2007
Springer
14 years 1 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...