DeepAI AI Chat
Log In Sign Up

The Inductive Logic of Information Systems

by   Norman C. Dalkey, et al.

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such systems. It is not complete for information systems with more than two hypotheses, but applies to a subset of such systems. The logic is inductive in that conclusions are more informative than premises. Inferences using the formalism have a strong justification in terms of the expected value of the derived information system.


page 1

page 2

page 3

page 4

page 5

page 6

page 7


Imparo is complete by inverse subsumption

In Inverse subsumption for complete explanatory induction Yamamoto et al...

Infinitary and Cyclic Proof Systems for Transitive Closure Logic

We formulate an infinitary proof system for transitive closure logic, wh...

Preprocessing in Inductive Logic Programming

Inductive logic programming is a type of machine learning in which logic...

Countability of Inductive Types Formalized in the Object-Logic Level

The set of integer number lists with finite length, and the set of binar...

Efficient predicate invention using shared "NeMuS"

Amao is a cognitive agent framework that tackles the invention of predic...

Inductive Logic Boosting

Recent years have seen a surge of interest in Probabilistic Logic Progra...

AI Reasoning Systems: PAC and Applied Methods

Learning and logic are distinct and remarkable approaches to prediction....