By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...