نتایج جستجو برای: soft deductive system
تعداد نتایج: 2340539 فیلتر نتایج به سال:
in soft soil areas, equal-length piles are often adopted in the retaining system. a decrease in the bending moment value borne by the retaining structure along the pile depth (below the excavation bottom), leads to an inadequate use of the pile bending capacity near the pile bottom. this paper presents retaining systems with long and short pile combinations, in which the long piles ensure integ...
Systems of conjunction, particularly where the conjunction of noncanonical constituents is involved, are not invariant across the range of natural languages. In this paper, we examine a number of problems involving conjunction and show that one apparent watershed between diierent systems of conjunction corresponds to a distinction in the scope of associativity rules in the landscape of substruc...
The power of deductive systems in general is that programs express what should be done and not how it should be done Nevertheless deductive systems need debugging and explanation facilities Indeed their operational semantics is less abstract than the declarative semantics of the programs If users have to understand all the low level details of the operational semantics much of the bene ts of us...
This chapter presents a framework that uses metaqueries to integrate inductive learning methods with deductive database technologies in the context of knowledge discovery from databases. Metaqueries are second-order predicates or templates, and are used for (1) Guiding deductive data collection, (2) Focusing attention for inductive learning, and (3) Assisting human analysts in the discovery loo...
We show that reifying the rules from hyperedge weights to first-class graph nodes automatically gives us rule expectations in any kind of grammar expressible as a deductive system, without any explicit algorithm for calculating rule expectations (such as the insideoutside algorithm). This gives us expectation maximization training for any grammar class with a parsing algorithm that can be state...
This paper describes a deductive approach to "region use" planning problems. The planning task is viewed as one of devising a complete set of policy rules by iteratively modifying the rules and making their deductive consequences readily available to the planner. The application of this approach to a National Park region zoning problem is also described. Central to the system are the representa...
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for denotational and deductive completeness. Denotational completeness means that every value of the full set-theoretic type hierarchy can be described by a closed t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید