Sciweavers

574 search results - page 9 / 115
» On the Validity of Hierarchical Decompositions
Sort
View
JAPLL
2006
109views more  JAPLL 2006»
13 years 8 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
SKG
2006
IEEE
14 years 2 months ago
Functional Dependency Maintenance and Lossless Join Decomposition in XML Model Decomposition
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...
Xia Li, Fei-yue Ye, Hong-juan Yuan, Wen-tao Peng
AAAI
1998
13 years 10 months ago
Maintaining Consistency in Hierarchical Reasoning
We explore techniques for maintaining consistency in reasoning when employing dynamic hierarchical task decompositions. In particular, we consider the difficulty of maintaining co...
Robert E. Wray III, John E. Laird
AISC
2006
Springer
14 years 12 days ago
Hierarchical Representations with Signatures for Large Expression Management
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...
SOCO
2009
Springer
14 years 3 months ago
Feature (De)composition in Functional Programming
Abstract. The separation of concerns is a fundamental principle in software engineering. Crosscutting concerns are concerns that do not align with hierarchical and block decomposit...
Sven Apel, Christian Kästner, Armin Grö&...