scholarly journals Construction of digital nets based on propagation rules for OOAs

PAMM ◽  
2007 ◽  
Vol 7 (1) ◽  
pp. 1022601-1022602
Author(s):  
Rudolf Schürer
2009 ◽  
Vol 79 (270) ◽  
pp. 993-1017 ◽  
Author(s):  
Josef Dick ◽  
Peter Kritzer

2014 ◽  
pp. 285-297
Author(s):  
Josef Dick ◽  
Friedrich Pillichshammer

Author(s):  
Josef Dick ◽  
Friedrich Pillichshammer
Keyword(s):  

Author(s):  
Yiding Yang ◽  
Jiayan Qiu ◽  
Mingli Song ◽  
Dacheng Tao ◽  
Xinchao Wang

2005 ◽  
Vol 5 (4-5) ◽  
pp. 441-465 ◽  
Author(s):  
SEBASTIAN BRAND ◽  
KRZYSZTOF R. APT

We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic iteration algorithm of Apt (2000). We apply this study to so-called membership rules of Apt and Monfroy (2001). This leads to an implementation that yields a considerably better performance for these rules than their execution as standard CHR rules. Finally, we show how redundant rules can be identified and how appropriately reduced sets of rules can be computed.


2014 ◽  
pp. 395-433
Author(s):  
Josef Dick ◽  
Friedrich Pillichshammer
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document