In this paper knowledge representation and inference issues for rule-based systems are discussed. The paper deals with improving the logical calculus of Set Attributive Logic founding an expressive rule language XTT. Representation extensions are introduced, and practical inference rules provided. The original includes an extended state specification, as well as interpreter design. Examples of ...

In this note I describe a novel approach to modelling and exploiting probabilistic dependencies in compositional hierarchies for model-based scene interpretation. I present Bayesian Compositional Hierarchies (BCHs) which capture all probabilistic information about the objects of a compositional hierarchy in object-centered aggregate representations. BCHs extend typical Bayesian Network models b...

The Mamdani and TSK fuzzy models are fuzzy inference engines which have been most widely applied in real-world problems. Compared to the Mamdani approach, the TSK approach is more convenient when the crisp outputs are required. Common to both approaches, when a given observation does not overlap with any rule antecedent in the rule base (which usually termed as a sparse rule base), no rule can ...

Conditional equational theories can be built into logic programming using a generalized resolution rule which calls a universal uniication procedure. Such uniication procedures are often deened by sound and strongly complete sets of inference rules. In other words, to resolve upon two atoms requires to show-by means of the inference rules-that the corresponding arguments of the atoms are equal ...

In this technical report we describe the XML code generation component for the rule modeling tool Strelka. The component implementation is based on the compositional mapping from the URML metamodel into R2ML XML markup. We define a mapping function for derivation, production and reaction rules. Keyword List Rules, URML, R2ML, Rule Markup Language, Semantic Web, Rule Interchange Project co-funde...

Notions and Inference Systems for Proofs by Mathematical Induction Claus-Peter Wirth? and Klaus Becker Fb. Informatik, Universität Kaiserslautern, D-67663, Germany {wirth, klbecker}@informatik.uni-kl.de Abstract. Soundness of inference systems for inductive proofs is sometimes Soundness of inference systems for inductive proofs is sometimes shown ad hoc and a posteriori, lacking modularization ...

Due to the special characteristics and challenges in Chinese language, event extraction in Chinese is much more difficult than that in English. In particular, the state-of-the-art Chinese event extraction systems suffer much from the low recall in trigger identification due to the failure in identifying unknown triggers and the inconsistency in identifying trigger mentions. To resolve these two...