We analyse the space complexity of specific formula structures constructed using the core language of the LogicGuard framework. Unlike previous analysis which focused on the local space complex around a single quantifier, in this work we fix the global structure of the formula enough to allow analysis as a whole. Though we end up with precise results for two very specific cases, we show that th...

Reachability analysis consists in checking if a state satisfying some property is reachable. In this paper a solution to the problem of generating formulae expressing reachability properties for concrete models is suggested. The traditional methods either require the user to input the formula manually, which can be very tedious and error-prone, or automatically generate formulae for some fixed ...

Let L be a first-order language and let M = 〈M, I〉 be a model for L. Then every formula φ(x1, . . . , xn) of L determines a unique n-place predicate: φ = {〈a1, . . . , an〉 ∈M n : M |= φ[a1, . . . , an]} Here, of course, the notation φ(x1, . . . , xn) is used to indicate that the free variables of φ constitute a subset of {x1, . . . , xn} (see [1] p. 24). A n-placed relation R ⊆M is said to be d...

This short paper is focused on the formal semantic model: Universal Semantic Code (USC), which acquires a semantic lexicon from thesauruses and pairs it with formal meaning representation. The USC model postulates: Knowledge Inference (KI) is effective only on the basis of Semantic Knowledge Representation (SKR). The USC model represents formalized meanings of verbs and phrasal verbs as a main ...

In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the meaning of counting and choice by reducing these constructs to first-order formulas. For the new lang...

We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean formula composition. This gives rise to new protocol techniques. We show that interactive PZK for random self-reducible languages (RSR) (and for co-RSR) is closed under monotone boolean formula composition. Namely, we ...

In this paper, we study an expressive fragment, namely Gμ, of linear time μ-calculus as a highlevel goal specification language. We define Goal Progression Form (GPF) for Gμ formulas and show that every closed formula can be transformed into this form. Based on GPF, we present the notion of Goal Progression Form Graph (GPG) which can be used to describe models of a formula. Further, we propose ...

A class of Kripke frames is called modally definable if there is a set of modal formulas such that the class consists exactly of frames on which every formula from that set is valid, i. e. globally true under any valuation. Here, existential definability of Kripke frame classes is defined analogously, by demanding that each formula from a defining set is satisfiable under any valuation. This is...

In this paper, we present some ideas about possible directions of a new interpretation of the Okapi BM25 ranking formula. In particular, we have focused on a full bayesian approach for deriving a smoothed formula that takes into account a-priori knowledge on the probability of terms. In fact, most of the efforts in improving the BM25 were done in capturing the language model (frequencies, lengt...

We provide a language for formulating a range of state space models with response densities within the exponential family. The described methodology is implemented in the R-package sspir. A state space model is specified similarly to a generalized linear model in R, and then the time-varying terms are marked in the formula. Special functions for specifying polynomial time trends, harmonic seaso...