Although declarative configurability still predominates in the context of communication bindings, the hidden policies involved make it an unlikely candidate to cope with the ever...
Attribute grammars have been used extensively in every phase of traditional compiler construction. Recently, it has been shown that they can also be effectively adopted to handle ...
George Economakos, George K. Papakonstantinou, Pan...
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...