A Boolean function is called k-convex if for any pair x; y of its true points at Hamming distance at most k, every point \between" x and y is also true. Given a set of true points and a set of false points, the central question of Logical Analysis of Data is the study of the Boolean functions whose values agree with those of the given points. In this paper we examine such data sets which admit ...

Even though the Linking Open Data cloud is constantly growing, there is a serious lack of published data sets related to the domain of academic mathematics. At the same time, since most scholarly publications in mathematics are well-structured and conventional, it’s promising to get their helpful detailed representation. The paper describes an approach to extracting and analyzing the structure ...

The aim of this work is to propose a model-theoretic semantics and a complete logic for the dynamics of commitments. In the first part of the article, a formalization of the concept of social commitment in STIT logic is presented. STIT is one of the most prominent formal accounts of agency. It is the logic of constructions of the form “agent i sees to it that φ”. In the second part, the article...

Suppose one is given a (incomplete) specification of a set of interacting reactions. We would use this set of formulas as the background theory T . Suppose additionally, that a number of observations are made referring to reactions known to have occurred, or compounds known to be available for participation in a reaction, etc. Let α denote the formula representing these observations. Generally,...

Diffie-Hellman protocols for authenticated key agreement construct a shared secret with a peer using a minimum of communication and using limited cryptographic operations. However, their analysis has been challenging in computational models and especially in symbolic models. In this paper, we develop a logical framework for protocol analysis based on strand space ideas. We show that it identifi...

In such areas as knowledge discovery, data mining and logical analysis of data, methodologies to 0nd relations among attributes are considered important. In this paper, given a data set (T; F) where T ⊆ {0; 1}n denotes a set of positive examples and F ⊆ {0; 1}n denotes a set of negative examples, we propose a method to identify decomposable structures among the attributes of the data. We 0rst s...

In the past few years a lot of attention has been paid to the use of special logics to analyse cryptographic protocols, foremost among these being the logic of Burrows, Abadi and Needham (the BAN logic). These logics have been successful in nding weaknesses in various examples. In this paper limitations of the BAN logic are illustrated with two examples. Consideration of the attacks leads to a ...

ÐThe paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for explaining all observations and the detection of hidden patterns in the data capable of distinguishing observations describing apositiveo outcome events from anegativeo outcome events. Combinations of s...

IT IS WITH BOTH PRIDE AND HESITATION THAT I AGREED TO WRITE THIS ARTICLE ON phenomenology and logical analysis. John Searle and Bert Dreyfus are for me two of the paradigm figures of contemporary philosophy, so I am extremely proud to have been offered the opportunity to engage with their work. The editors of The Harvard Review of Philosophy, it seems to me, have shown a keen sense of what is d...

Business Process Modeling Notation has become a powerful and widely accepted visual language for modeling business processes. Despite its expressive power and high usability, a weak point of BPMN is the lack of formal semantics and difficulties with assuring correctness of the overall process. In this paper an attempt is made towards investigation and development of foundations for a logical, d...