We present a logical separability analysis for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Quantum setting is harder to deal with since it introduces non determinism and thus considerably modifies semantic...

Diagrammatic reasoning can be described formally by a number of diagrammatic logics; spider diagrams are one of these, and are used for expressing logical statements about set membership and containment. Here, existing work on spider diagrams is extended to include constant spiders that represent specific individuals. We give a formal syntax and semantics for the extended diagram language befor...

In information retrieval, the uncertain implication D −→ RQ has been different logical status. In this paper, we propose another way to consider this implication in fuzzy context. We introduce a logical formulation based on logical consequence and an evaluation based on an extension of fuzzy Galois connection. The proposed matching function deals with different semantics associated with terms d...

The meaning of a proposition in classical logic is ordinarily given denotationally by saying that a proposition stands for either > or ⊥. The logical connectives are defined by truth tables displaying the graph of their associated functions on truth values. The denotational semantics of classical logic emphasizes the “absolute” truth or falsehood of a proposition, independently of how we, as hu...

Abstract Discounting future costs and rewards is a common practice in accounting, game theory machine learning. In spite of this, existing logics for reasoning about strategies with cost resource constraints do not account discounting. The article proposes sound complete logical system budget-constrained strategic abilities that incorporates discounting into its semantics.

In [13] the authors developed a logical system based on the definition of a new non-classical connective ⊗ originally capturing the notion of reparative obligation. The operator⊗ and the system were proved to be appropriate for rather handling well-known contrary-to-duty paradoxes. Later on, a suitable modeltheoretic possible-world semantics has been developed [4, 5]. In this paper we show how ...

In this thesis, we propose a unified framework for the pragmatics and the semantics of agent communication. Pragmatics deals with the way agents use communicative acts when conversing. It is related to the dynamics of agent interactions and to the way of connecting individual acts while building complete conversations. Semantics is interested in the meaning of these acts. It lays down the found...

This paper introduces a semantic theo-semantics can interpret the temporal and modal sense and anaphora. At present there are three main aspects in semantical field: 1. Transformation of' sentences or discourses into formulas in high order logic. 2. Semantic interpretation of the logical formulas. 3. Semantic ambiguity. This paper presents the semantics, dynamic logic with possible world, which...

The article studies knowledge in multiagent systems where data available to the agents may have small errors. To reason about such uncertain knowledge, a formal semantics is introduced in which indistinguishability relations, commonly used in the semantics for epistemic logic S5, are replaced with metrics to capture how much two epistemic worlds are different from an agent’s point of view. The ...

We present an approach to learning a modeltheoretic semantics for natural language tied to Freebase. Crucially, our approach uses an open predicate vocabulary, enabling it to produce denotations for phrases such as “Republican front-runner from Texas” whose semantics cannot be represented using the Freebase schema. Our approach directly converts a sentence’s syntactic CCG parse into a logical f...