A new tree-based representation for propositional formulas is introduced. This representation, the ∆-trees, allows a compact representation for well-formed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of

The pretheoretical notions of logical consequence and of a logical expression are linked in vague and complex ways to modal and pragmatic intuitions. I offer an introduction to the difficulties that these intuitions create when one attempts to give precise characterizations of those notions. Special attention is given to Tarski’s theories of logical consequence and logical constancy. I note tha...

We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML/XML documents are guaranteed to be well-formed. In addition, each library can guarantee that the generated documents are valid XML documents to a certain extent (for HTML only a weaker guarantee is possible). On top o...

We investigate structural properties of statistical zero knowledge (SZK) both in the interactive and in the non-interactive model. Specifically, we look into the closure properties of SZK languages under monotone logical formula composition. This gives rise to new protocol techniques. We show that interactive SZK for random self reducible languages (RSR) (and for CO-RSR) is closed under monoton...

Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...

Poorly translated text is often disfluent and difficult to read. In contrast, well-formed translations require less time to process. In this paper, we model the differences in reading patterns of Machine Translation (MT) evaluators using novel features extracted from their gaze data, and we learn to predict the quality scores given by those evaluators. We test our predictions in a pairwise rank...

The present article shows that the normalization of documents in limited domains, such as drug leaflets, can be improved over what can be done with current technologies and without putting more constraints on the technical writer’s work. We propose a novel approach to document normalization that uses well-formed content representations expressed at the level of communicative goals and associate...

Abstract Purpose: The aim of the present study is to validate the applied model for the school management excellence program implementation.  Methodology: This study was a correlation and survey methods. All 20 middle and high schools located in districts 1 and 2 of Ardabil city, which have been the implementers of the excellence program during the last two years, were selected and their huma...

So, you can write a program that generates other programs. Sorry, . . . not impressed. You want to impress me? Make sure your program-generating program only produces well-formed programs. What is “well-formed”, you ask? Well, let’s start with “it parses”. Then let’s get to “. . . and type-checks”. You want to really impress me? Give me an expressive language for program generators in which any...