Sciweavers

4266 search results - page 43 / 854
» Search for More Declarativity
Sort
View
ICMCS
2000
IEEE
95views Multimedia» more  ICMCS 2000»
14 years 1 months ago
Descriptive-Procedural Configuration of Communication Bindings
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...
Thorsten Kramp, Rainer Koster
DATE
1998
IEEE
165views Hardware» more  DATE 1998»
14 years 1 months ago
AGENDA: An Attribute Grammar Driven Environment for the Design Automation of Digital Systems
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...
BXML
2004
13 years 10 months ago
Binary Queries and XML Transformations
: 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. ...
Alexandru Berlea
KSEM
2010
Springer
13 years 7 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
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...
Yves Moinard
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
14 years 6 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
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...
Frederik Janssen, Johannes Fürnkranz