The pi-calculus process algebra describes the interaction of concurrent and communicating processes. In this paper we present the syntax and semantics of a dynamic epistemic logic for multi-agent systems, where the epistemic actions are finite processes in the pi-calculus. We then extend the language to include actions from a specified set of action structures. We define a proof system for the ...

1. From the point of view of the general cybernetic theory we consider language to be a device, which regulates the information streams in social systems. 1 On this basis it is possible to come to the conclusion of bilateral dependency of the language organization level (the level of its complexity) on (1) complexity value of the language mechanism input information stream, and (2) complexity v...

We present a semantics for Probabilistic Description Logics that is based on the distribution semantics for Probabilistic Logic Programming. The semantics, called DISPONTE, allows to express assertional probabilistic statements. We also present two systems for computing the probability of queries to probabilistic knowledge bases: BUNDLE and TRILL. BUNDLE is based on the Pellet reasoner while TR...

The Boolean satisfiability (SAT) problem asks whether the variables in a given Boolean formula can be assigned in such a way that the formula evaluates to true. Given a Boolean formula, a SAT solver tries to find a set of satisfying assignments or declares that the formula is unsatisfiable. In this project, we implemented a parallel SAT solver using the Cilk multithreaded programming language. ...

We introduce the first-order dynamic logic DLP for Promela, a language subsuming the modelling language Promela of the Spin model checker. In DLP trace modalities can be used to reason about the temporal properties of programs. The definition of DLP includes a formal semantics of the Promela language. A sound and relatively complete sequent calculus is given, which allows deductive theorem prov...

Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. ...

We present a logical approach of spoken language understanding for a human-machine dialogue system. The aim of the analysis is to provide a logical formula, or a conceptual graph, by assembling concepts related to a delimited application domain. This flexible structure is gradually built during an incremental parsing, which is meant to combine syntactic and semantic criteria. Then, a contextual...

Both the quality of the results of TEX s formula layout algorithm and the complexity of its description in the TEXbook are hard to beat The algorithm is verbally described as an imperative program with very complex control ow and complicated manipulations of the data structures representing formulae In a forthcoming textbook we describe TEX s formula layout algorithm as a functional program tra...

A large set of partial data models is used in designing a large information system. These partial data models provide several complementary views on the system to be developed. This however leads to a need for compositional models that are able to produce a single integrated model. These data models are often described by a class diagram of Unified Modeling Language because it is a very popular...

Spreadsheets are end-user programs and domain models that are heavily employed in administration, financial forecasting, education, and science because of their intuitive, flexible, and direct approach to computation. As a result, institutions are swamped by millions of spreadsheets that are becoming increasingly difficult to manage, access, and control. This note presents the XLSearch system, ...