A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
Authoring documents in MKM formats like OMDoc is a very tedious task. After years of working on a semantically annotated corpus of STEX documents (GenCS), we identified a set of co...
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...