A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈ S, where S is the unit interval of a recursive nonarchimedean field, an unary operator P≥s(α) and binary operators CP=s(α, β) and CP≥s(α, β) (with the intended meaning ”the probability of α is at least s”, ”the condition...

This paper defines a selection problem which selects an appropriate object from a set that is specified by parameters. We discuss inductive learning of selection problems and give a method combining inductive logic programming (ILP) and Bayesian learning. It induces a binary relation comparing likelihood of objects being selected. Our methods estimate probability of each choice by evaluating va...

Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with non-binary constraints is quite different. Only very recently have domain filtering consistencies stronger than G...

The remarkable contribution by Weitz gives a general framework to establish the strong spatial mixing property of Gibbs measures. In light of Weitz’s work, we prove the strong spatial mixing for binary Markov random fields under the condition that the ‘external field’ is uniformly large or small by turning them into a corresponding Ising model. Our proof is done through a ‘path’ characterizatio...

A Chu space is a binary relation =| from a set A to an antiset X defined as a set which transforms via converse functions. Chu spaces admit a great many interpretations by virtue of realizing all small concrete categories and most large ones arising in mathematical and computational practice. Of particular interest for computer science is their interpretation as computational processes, which t...

One of the most important and well known theorem in the class of dyadic spaces is Esenin-Volpin’s theorem of weight of dyadic spaces. The aim of this paper is to prove Esenin-Volpin’s theorem in general form in class of thick spaces which possesses special subbases.

Binary systems comprising at least one neutron star contain strong gravitational field regions and thereby provide a testing ground for strong-field gravity. Two types of data can be used to test the law of gravity in compact binaries: binary pulsar observations, or forthcoming gravitational-wave observations of inspiralling binaries. We compare the probing power of these two types of observati...

Binary pulsars are excellent laboratories to test the building blocks of Einstein's theory of general relativity. One of these is Lorentz symmetry, which states that physical phenomena appear the same for all inertially moving observers. We study the effect of violations of Lorentz symmetry in the orbital evolution of binary pulsars and find that it induces a much more rapid decay of the binary...

The semantic binary engine is a database management system built on the principles of the Semantic Binary Data Model (Rishe, 1992). A semantic binary database is a set of facts about objects. Objects belong to categories, are connected by relations, and may have attributes. The concept of an object is at the core of the data model and it is crucial to have efficient algorithms that allow the se...