DeepAI AI Chat
Log In Sign Up

Inference Rules for Binary Predicates in a Multigranular Framework

by   Stephen J. Hegner, et al.

In a multigranular framework, the two most important binary predicates are those for subsumption and disjointness. In the first part of this work, a sound and complete inference system for assertions using these predicates is developed. It is customized for the granular framework; particularly, it models both bottom and top granules correctly, and it requires all granules other then the bottom to be nonempty. Furthermore, it is single use, in the sense that no assertion is used more than once as an antecedent in a proof. In the second part of this work, a method is developed for extending a sound and complete inference system on a framework which admits Armstrong models to one which provides sound and complete inference on all assertions, both positive and negative. This method is then applied to the binary granule predicates, to obtain a sound and complete inference system for subsumption and disjointness, as well as their negations.


page 1

page 2

page 3

page 4


A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

We present an equational inference system for finite-state expressions, ...

On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach

A lattice-theoretic framework is introduced that permits the study of th...

Causes of Ineradicable Spurious Predictions in Qualitative Simulation

It was recently proved that a sound and complete qualitative simulator d...

Global-scale phylogenetic linguistic inference from lexical resources

Automatic phylogenetic inference plays an increasingly important role in...

Towards a Consistent, Sound and Complete Conceptual Knowledge

Knowledge is only good if it is sound, consistent and complete. The same...

Categorification of Negative Information using Enrichment

In many applications of category theory it is useful to reason about "ne...

Kleene Algebra Modulo Theories

Kleene algebras with tests (KATs) offer sound, complete, and decidable e...