400 research outputs found

    Well structured program equivalence is highly undecidable

    Full text link
    We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We introduce the construction of program equivalence, which returns the value T\mathsf{T} precisely when two given programs are equivalent on halting computations. We show that virtually any variant of propositional dynamic logic has Π11\Pi_1^1-hard validity problem if it can express even just the equivalence of well-structured programs with the empty program \texttt{skip}. We also show, in these cases, that the set of propositional statements valid over finite models is not recursively enumerable, so there is not even an axiomatisation for finitely valid propositions.Comment: 8 page

    Relative Expressive Power of Navigational Querying on Graphs

    Get PDF
    Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projection; coprojection; converse; and the diversity relation. All these operators map binary relations to binary relations. We compare the expressive power of all resulting languages. We do this not only for general path queries (queries where the result may be any binary relation) but also for boolean or yes/no queries (expressed by the nonemptiness of an expression). For both cases, we present the complete Hasse diagram of relative expressiveness. In particular the Hasse diagram for boolean queries contains some nontrivial separations and a few surprising collapses.Comment: An extended abstract announcing the results of this paper was presented at the 14th International Conference on Database Theory, Uppsala, Sweden, March 201

    Modal Logics of Topological Relations

    Full text link
    Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the Egenhofer-Franzosa (or RCC8) relations between regions in topological spaces such as the real plane. We investigate the expressive power and computational complexity of logics obtained in this way. It turns out that our modal logics have the same expressive power as the two-variable fragment of first-order logic, but are exponentially less succinct. The complexity ranges from (undecidable and) recursively enumerable to highly undecidable, where the recursively enumerable logics are obtained by considering substructures of structures induced by topological spaces. As our undecidability results also capture logics based on the real line, they improve upon undecidability results for interval temporal logics by Halpern and Shoham. We also analyze modal logics based on the five RCC5 relations, with similar results regarding the expressive power, but weaker results regarding the complexity

    Decidability of equational theories for subsignatures of relation algebra

    Get PDF
    Let S be a subset of the signature of relation algebra. Let R(S) be the closure under isomorphism of the class of proper S-structures and let F(S) be the closure under isomorphism of the class of proper S-structures over finite bases. Based on previous work, we prove that membership of R(S) is undecidable when (Formula presented), and for any of these signatures S if converse is excluded from S then membership of F(S) is also undecidable, for finite S-structures. We prove that the equational theories of F(S) and R(S) are undecidable when S includes composition and the signature of boolean algebra. If all operators in S are positive and it does not include negation, or if it can define neither domain, range nor composition, then the equational theory of either class is decidable. Open cases for decidability of the equational theory of R(S) are when S can define negation but not meet (or join) and either domain, range or composition. Open cases for the decidability of the equational theory of F(S) are (i) when S can define negation, converse and either domain, range or composition, and (ii) when S contains negation but not meet (or join) and either domain, range or composition

    Investigation of the tradeoff between expressiveness and complexity in description logics with spatial operators

    Get PDF
    Le Logiche Descrittive sono una famiglia di formalismi molto espressivi per la rappresentazione della conoscenza. Questi formalismi sono stati investigati a fondo dalla comunit\ue0 scientifica, ma, nonostante questo grosso interesse, sono state definite poche Description Logics con operatori spaziali e tutte centrate sul Region Connection Calculus. Nella mia tesi considero tutti i pi\uf9 importanti formalismi di Qualitative Spatial Reasoning per mereologie, mereo-topologie e informazioni sulla direzione e studio alcune tecniche generali di ibridazione. Nella tesi presento un\u2019introduzione ai principali formalismi di Qualitative Spatial Reasoning e le principali famiglie di Description Logics. Nel mio lavoro, introduco anche le tecniche di ibridazione per estendere le Description Logics al ragionamento su conoscenza spaziale e presento il potere espressivo dei linguaggi ibridi ottenuti. Vengono presentati infine un risultato generale di para-decidibilit\ue0 per logiche descrittive estese da composition-based role axioms e l\u2019analisi del tradeoff tra espressivit\ue0 e propriet\ue0 computazionali delle logiche descrittive spaziali.Description Logics are a family of expressive Knowledge-Representation formalisms that have been deeply investigated. Nevertheless the few examples of DLs with spatial operators in the current literature are defined to include only the spatial reasoning capabilities corresponding to the Region Connection Calculus. In my thesis I consider all the most important Qualitative Spatial Reasoning formalisms for mereological, mereo-topological and directional information and investigate some general hybridization techniques. I will present a short overview of the main formalisms of Qualitative Spatial Reasoning and the principal families of DLs. I introduce the hybridization techniques to extend DLs to QSR and present the expressiveness of the resulting hybrid languages. I also present a general paradecidability result for undecidable languages equipped with composition-based role axioms and the tradeoff analysis of expressiveness and computational properties for the spatial DLs

    Computabilities of Validity and Satisfiability in Probability Logics over Finite and Countable Models

    Full text link
    The ϵ\epsilon-logic (which is called ϵ\epsilonE-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the ∀x\forall x quantifier is interpreted as "there exists a set AA of measure ≥1−ϵ\ge 1 - \epsilon such that for each x∈Ax \in A, ...." Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational ϵ∈(0,1)\epsilon \in (0, 1), respectively Σ11\Sigma^1_1-complete and Π11\Pi^1_1-hard, and ii) for ϵ=0\epsilon = 0, respectively decidable and Σ10\Sigma^0_1-complete. The adjective "general" here means "uniformly over all languages." We extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability by and validity over finite models in ϵ\epsilonE-logic are, i) for rational ϵ∈(0,1)\epsilon \in (0, 1), respectively Σ10\Sigma^0_1- and Π10\Pi^0_1-complete, and ii) for ϵ=0\epsilon = 0, respectively decidable and Π10\Pi^0_1-complete. Although partial results toward the countable case are also achieved, the computability of ϵ\epsilonE-logic over countable models still remains largely unsolved. In addition, most of the results, of this paper and of Kuyper and Terwijn, do not apply to individual languages with a finite number of unary predicates. Reducing this requirement continues to be a major point of research. On the positive side, we derive the decidability of the corresponding problems for monadic relational languages --- equality- and function-free languages with finitely many unary and zero other predicates. This result holds for all three of the unrestricted, the countable, and the finite model cases. Applications in computational learning theory, weighted graphs, and neural networks are discussed in the context of these decidability and undecidability results.Comment: 47 pages, 4 tables. Comments welcome. Fixed errors found by Rutger Kuype

    Axiomatizing the Logical Core of XPath 2.0

    Get PDF

    Generalized Satisfiability Problems via Operator Assignments

    Full text link
    Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For the case of constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We obtain a complete characterization of the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction problems. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps. We also present several additional applications of this method. In particular and perhaps surprisingly, we show that the relaxed notion of pp-definability in which the quantified variables are allowed to range over operator assignments gives no additional expressive power in defining Boolean relations
    • …
    corecore