Restructuring and simplifying rule bases.

Rule bases are commonly acquired, by expert and/or knowledge engineer, in a form which is well suited for acquisition purposes. When the knowledge base is executed, however, a different structure may be required. Moreover, since human experts normally do not provide the knowledge in compact chunks, rule bases often suffer from redundancy. This may considerably harm efficiency. In this paper a procedure is examined to transform rules that are specified in the knowledge acquisition process into an efficient rule base by way of decision tables. This transformation algorithms allows the generation of a minimal rule representation of the knowledge, and verification and optimization of rule bases and other specification (e.g. legal texts, procedural descriptions, ...). The proposed procedures are fully supported by the PROLOGA tool.

The “25% Rule” for Patent Infringement Damages After Uniloc

The 2011 decision by the Federal Circuit in Uniloc v. Microsoft properly condemned the “25% Rule,” which bases a reasonable royalty on 25% of an infringer’s profits. Nonetheless, at least one proponent of the Rule continues to argue that the Rule is fundamentally valid and should remain in use. This article analyzes the historical development of the Rule, its conceptual basis, its application in actual cases, and relevant insights from other recent Federal Circuit cases. Each analysis shows fundamental problems and contradictions that demonstrate the Rule can never be a reliable patent damages methodology. There is no reason to change the conclusion in Uniloc

A principled framework for modular web rule bases and its semantics

We present a principled framework for modular web rule bases, called MWeb. According to this framework, each predicate defined in a rule base is characterized by its defining reasoning mode, scope, and exporting rule base list. Each predicate used in a rule base is characterized by its requesting reasoning mode and importing rule base list. For valid MWeb modular rule bases S, theMWebAS andMWebWFS semantics of each rule base s ∈ S w.r.t. S are defined, model-theoretically. These semantics extend the answer set semantics (AS) and the well-founded semantics with explicit negation (WFSX) on ELPs, respectively, keeping all of their semantical and computational characteristics. Our framework supports: (i) local semantics and different points of view, (ii) local closed-world and open-world assumptions, (iii) scoped negation-as-failure, and (iv) restricted propagation of local inconsistencies. Additionally, it guarantees monotonicity of reasoning, in the case that new rule bases are added to the modular rule base, while the importing rule base list of the predicates of the old rule bases remains the same