215 search results - page 37 / 43 » Pattern Matching in Order-Sorted Languages |
DAGSTUHL
1990
14 years 10 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
ENTCS
2007
14 years 9 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
73
Voted
ESOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
BNCOD
2007
14 years 11 months ago
2007
Abstract. Information Extraction, the process of eliciting data from natural language documents, usually relies on the ability to parse the document and then to detect the meaning ...