Logic in Computer Science, 2003. Proceedings. 18Th Annual IEEE Symposium On

Total Page:16

File Type:pdf, Size:1020Kb

Logic in Computer Science, 2003. Proceedings. 18Th Annual IEEE Symposium On Spectrum Hierarchies and Subdiagonal Functions Aaron Hunter Department of Computing Science Simon Fraser University Burnaby, Canada [email protected] Abstract been done on the properties of the classes in Fagin’s pro- posed spectrum hierarchy. The spectrum of a first-order sentence is the set of cardi- Similarly, very little is known about the classes of spec- nalities of its finite models. Relatively little is known about tra obtained by varying the number of binary relation sym- the subclasses of spectra that are obtained by looking only bols, or the number of unary relation symbols allowed in at sentences with a specific signature. In this paper, we sentences. In this paper, we will use model-theoretic tech- study natural subclasses of spectra and their closure prop- niques to explore the properties of these restricted classes erties under simple subdiagonal functions. We show that of spectra. many natural closure properties turn out to be equivalent to the collapse of potential spectrum hierarchies. We prove all 1.2. Closure Properties of our results using explicit transformations on first-order structures. Given a set of natural numbers S and a function f over the natural numbers, we write f(S) as a shorthand notation for {f(n)|n ∈ S}. We say that a class of spectra S is closed 1. Introduction under f if f(S) ∈Swhenever S ∈S. Using explicit transformations on graphs, More proves 1.1. Historical Motivation that F2 is closed under every polynomial with rational co- efficients that is assymptotically greater than the identity The spectrum of a first-order sentence φ is the set of car- function [12]. In this paper, we study closure properties un- dinalities of its finite models. Let Sp(φ) denote the spec- der functions that are assymptotically less than the identity trum of φ and let SPEC denote the set of all spectra. function. It turns out that establishing these closure proper- Let BIN1 denote the class of spectra of sentences involv- ties is more difficult. ing a single binary relation symbol. In [5], Fagin asks if every spectrum is in BIN1. Actually, Fagin restricts the sin- 1.3. Summary of Main Results gle relation to be irreflexive and symmetric, but we will al- low an arbitrary relation in this paper. Fagin also introduces In order to summarize our results, we introduce a more a potential spectrum hierarchy. Let Fk denote the class of general notation for subclasses of spectra. spectra of sentences involving relation symbols of arity at m ,...,m S ∈F k 1 S = (φ) most k. Clearly Fk ⊆Fk+1 for all k. Fagin proposes that Definition k if Sp for some sentence φ this hierarchy is strict, yet no one has been able to prove that which satisfies the following conditions: it does not collapse to the second level. 1. for each i ≤ k, φ involves at most mi relation symbols F Relatively little is known about the classes k.Partof of arity i the reason that they are not understood is because research on spectra has tended to rely heavily on the techniques 2. φ involves no other non-logical symbols. of descriptive complexity theory. Many interesting results p p,0 It will be convenient to write F2 as a shorthand for F2 . have been proved by characterizing subclasses of spectra in 1 1 We remark that BIN = F2 . terms of complexity, and then applying the results of com- We study three potential spectrum hierarchies: plexity theory [7, 8, 11]. However, no natural characteriza- 1,0 1,1 1,2 tion of Fk has been given. As a result, little research has (1) F2 ⊆F2 ⊆F2 ⊆ ... Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS’03) 1043-6871/03 $17.00 © 2003 IEEE 1 2 3 (2) F2 ⊆F2 ⊆F2 ⊆ ... spectra. For example, it has been shown that, if there is a spectrum whose complement is not a spectrum, then there F ⊆F ⊆F ⊆ ... (3) 2 3 4 is one in BIN1 [4]. Establishing general arithmetic closure 1 The first hierarchy is based on the number of unary relation conditions for BIN and related classes may provide a first symbols in the sentence and the second hierarchy is based step towards an improved understanding of these important on the number of binary relation symbols. The third hier- subclasses of spectra. archy is Fagin’s hierarchy, and it is based on the arity of The results that we present give arithmetic conditions for the relation symbols. The inclusions given above are trivial, the collapse of some potential spectrum hierarchies. We do but it is not clear if any of them are strict. We remark that not know of any other attempts to systematically study the (1) is the simplest spectrum hierarchy that is worth study- arithmetic closure properties of SPEC under natural subdi- ing, because it is well-known that F1 is the set of finite and agonal functions. We prove our results using simple, de- co-finite sets. finable transformations on first-order structures. This kind In this paper, we prove that the collapse of each hierar- of proof was employed in Fagin’s early work[5] and more chy is equivalent to an arithmetic closure condition on the recently this approach was explicitly studied by More[12]. lowest level. In particular, we establish the following re- sults. 2 Preliminaries • (1) collapses ⇐⇒ BIN1 is closed under n → n − 1 1 n 2.1. Definitions and Notation • (2) collapses ⇐⇒ BIN is closed under n →2 √ • (3) collapses ⇐⇒ F 2 is closed under n → n . A finite set of non-logical symbols together with an arity for each symbol will be called a vocabulary (or a signature). In the last section of the paper, we turn our attention to We will assume that all vocabularies contain only relation 1 the class BINbo introduced in [3]. This is the class of spectra symbols. Given a vocabulary L = {R1,...,Rm},anL- of sentences involving a single binary relation symbol with structure M = M,P1,...,Pm is composed of a finite 1 bounded outdegree. More precisely, S ∈ BINbo if S = set M called the universe and, for each k-ary relation sym- k Sp(φ) for some φ involving a single binary relation symbol bol Ri, a relation Pi ⊆ M called the interpretation of Ri. R and there is some k such that every model of φ assigns R Note that, by convention, M is used to denote the universe a relation with outdegree bounded by k. Although this class of the structure M. Normally, RM will denote the interpre- 1 of spectra is clearly a subset of BIN , it is not clear if it is a tation of R in the structure M. Following the conventions 1 1 strict subset. We prove that, if BIN = BINbo,thenFagin’s of set theory, we identify n with the set {0,...,n−1} when hierarchy collapses. we are specifying the universe of a structure. Throughout the paper, we will generally assume that all The notation a¯ will be used as an abbreviation for a tuple signatures are relational. We remark that some related work (a1,...,an) when the value of n is understood or unimpor- has been done on a proposed spectrum hierarchy based on tant. If φ(¯x) is a formula with free variables x¯,thenwe signatures involving only unary function symbols[3, 6]. write M|= φ[¯a] to indicate that a¯ satisfies φ(¯x) in M.The satisfaction relation is defined rigorously in [2]. 1.4. Significance of the Results For some familiar functions f, we use a natural short- hand notation for f(S). For example, if f is n → n +1, The most famous problem in the theory of spectra was then S +1denotes f(S). posed by Asser, when he asked if SPEC is closed under complement [1]. This problem has proven to be very dif- 2.2. Methodology ficult, due to a well-known characterization of SPEC in terms of complexity theory. Given a set of natural numbers Typically, we will start with a vocabulary L1 and a func- S Sˆ , there is a corresponding language over the alphabet tion f. Given an L1-spectrum S, we will be interested in { , } 0 1 that contains the binary representation of every ele- proving that f(S) is the spectrum of a sentence in some tar- S S ∈ ment of . It has been shown that SPEC if and only get vocabulary L2. For example, we might be interested in Sˆ if is accepted in exponential time by a non-deterministic proving that, if S is an {R}-spectrum, then S +1is also an Turing machine [4, 9]. Hence, if Asser’s problem has a neg- {R}-spectrum. The prototypical question we are interested ative solution, it follows by a straightforward argument that in can be stated as follows: P = NP. This fact has motivated a great deal of research on spectra. (*) Given an L1-spectrum S and a function f Understanding BIN1 and the hierarchies we have out- whose domain includes S, does it follow lined in this section is important for our understanding of that f(S) is an L2-spectrum? Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS’03) 1043-6871/03 $17.00 © 2003 IEEE If L1 = L2, then we are simply asking if the class of L1- 3 Extra Unary relations spectra is closed under the function f. Our proofs will be constructive. Starting with an arbitrary L1-sentence φ, We now turn to our proposed spectrum hierarchy based ∗ ∗ we will contruct an L2-sentence φ such that Sp(φ )= on a single binary relation and an arbitrary number of unary f φ 1,p 1,p+1 (Sp( )).
Recommended publications
  • Mathematical Logic
    Copyright c 1998–2005 by Stephen G. Simpson Mathematical Logic Stephen G. Simpson December 15, 2005 Department of Mathematics The Pennsylvania State University University Park, State College PA 16802 http://www.math.psu.edu/simpson/ This is a set of lecture notes for introductory courses in mathematical logic offered at the Pennsylvania State University. Contents Contents 1 1 Propositional Calculus 3 1.1 Formulas ............................... 3 1.2 Assignments and Satisfiability . 6 1.3 LogicalEquivalence. 10 1.4 TheTableauMethod......................... 12 1.5 TheCompletenessTheorem . 18 1.6 TreesandK¨onig’sLemma . 20 1.7 TheCompactnessTheorem . 21 1.8 CombinatorialApplications . 22 2 Predicate Calculus 24 2.1 FormulasandSentences . 24 2.2 StructuresandSatisfiability . 26 2.3 TheTableauMethod......................... 31 2.4 LogicalEquivalence. 37 2.5 TheCompletenessTheorem . 40 2.6 TheCompactnessTheorem . 46 2.7 SatisfiabilityinaDomain . 47 3 Proof Systems for Predicate Calculus 50 3.1 IntroductiontoProofSystems. 50 3.2 TheCompanionTheorem . 51 3.3 Hilbert-StyleProofSystems . 56 3.4 Gentzen-StyleProofSystems . 61 3.5 TheInterpolationTheorem . 66 4 Extensions of Predicate Calculus 71 4.1 PredicateCalculuswithIdentity . 71 4.2 TheSpectrumProblem . .. .. .. .. .. .. .. .. .. 75 4.3 PredicateCalculusWithOperations . 78 4.4 Predicate Calculus with Identity and Operations . ... 82 4.5 Many-SortedPredicateCalculus . 84 1 5 Theories, Models, Definability 87 5.1 TheoriesandModels ......................... 87 5.2 MathematicalTheories. 89 5.3 DefinabilityoveraModel . 97 5.4 DefinitionalExtensionsofTheories . 100 5.5 FoundationalTheories . 103 5.6 AxiomaticSetTheory . 106 5.7 Interpretability . 111 5.8 Beth’sDefinabilityTheorem. 112 6 Arithmetization of Predicate Calculus 114 6.1 Primitive Recursive Arithmetic . 114 6.2 Interpretability of PRA in Z1 ....................114 6.3 G¨odelNumbers ............................ 114 6.4 UndefinabilityofTruth. 117 6.5 TheProvabilityPredicate .
    [Show full text]
  • Generalized First-Order Spectra and Polynomial-Time Recognizable Sets
    Generalized First-Order Spectra and Polynomial-Time Recognizable Sets Ronald Fagin Abstract: The spectrum of a first-order sentence σ is the set of cardi- nalities of its finite models. Jones and Selman showed that a set C of numbers (written in binary) is a spectrum if and only if C is in the complexity class NEXP (nondeterministic exponential time). An alternative viewpoint of a spectrum is to consider the spectrum of σ to be the class of finite models of the existential second-order sentence 9Qσ(Q), where Q is the similarity type (set of relational symbols) of σ.A generalized spectrum is the class of finite models of an exis- tential second-order sentence 9Qσ(P; Q), where σ is first-order with similarity type P [ Q, with P and Q disjoint. Let C be a class of finite structures with similarity type P, where C is closed under isomorphism. If P is nonempty, we show that C is a generalized spectrum if and only if the set of encodings of members of C is in NP. We unify this result with that of Jones and Selman by encoding numbers in unary rather than binary, so that C is a spectrum if and only if C is in NP. We then have that C is a generalized spectrum if and only if the set of encodings of members of C is in NP, whether or not P is empty. Using this connection between logic and complexity, we take results from complexity theory and convert them into results in logic.
    [Show full text]
  • BOUNDED DEGREE and PLANAR SPECTRA 1. Introduction The
    Logical Methods in Computer Science Vol. 13(4:6)2017, pp. 1–21 Submitted Sep. 08, 2016 https://lmcs.episciences.org/ Published Nov. 06, 2017 BOUNDED DEGREE AND PLANAR SPECTRA ANUJ DAWAR AND ERYK KOPCZYNSKI´ Department of Computer Science and Technology, University of Cambridge, J.J. Thomson Avenue, Cambridge CB3 0FD, England e-mail address: [email protected] Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland e-mail address: [email protected] Abstract. The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting models to be either planar (in the graph-theoretic sense) or by bounding the degree of elements. We show that the class of such spectra is still surprisingly rich by establishing that significant fragments of NE are included among them. At the same time, we establish non-trivial upper bounds showing that not all sets in NE are obtained as planar or bounded-degree spectra. 1. Introduction The spectrum of a sentence φ of some logic, denoted spec(φ), is the set of positive integers n such that φ has a model of cardinality n. In this paper we are solely concerned with first- order logic and we use the word spectrum to mean a set of integers that is is the spectrum of some first-order sentence. Scholz in [Sch52] posed the question of characterizing those sets of integers which are spectra.
    [Show full text]
  • A Framework for Representing and Solving NP Search Problems
    A Framework for Representing and Solving NP Search Problems David G. Mitchell and Eugenia Ternovska Simon Fraser University {mitchell,ter}@cs.sfu.ca Abstract substantial effort may be required to find good encodings for some problems. NP search and decision problems occur widely in AI, and a CSP provides somewhat better modelling capabilities. number of general-purpose methods for solving them have The area has also provided a number of useful techniques. been developed. The dominant approaches include propo- sitional satisfiability (SAT), constraint satisfaction problems For example, nogood learning and backjumping methods (CSP), and answer set programming (ASP). Here, we propose developed in the CSP context are central to modern SAT a declarative constraint programming framework which we solvers (Mitchell 2005). Solvers for CSP, however, have believe combines many strengths of these approaches, while found success primarily as components in constraint logic addressing weaknesses in each of them. We formalize our ap- programming (CLP) tools. These provide rich problem solv- proach as a model extension problem, which is based on the ing environments, but are really general purpose program- classical notion of extension of a structure by new relations. ming languages and thus neither purely declarative nor tai- A parameterized version of this problem captures NP. We dis- lored to problems of moderate (in)tractability. cuss properties of the formal framework intended to support ASP is the only area of these three that took modelling effective modelling, and prospects for effective solver design. methodology seriously from the outset. ASP input lan- guages provide essentially all the modelling facilities CSP Introduction does, within a purely declarative framework.
    [Show full text]
  • Fifty Years of the Spectrum Problem: Survey and New Results
    FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS A. DURAND, N. D. JONES, J. A. MAKOWSKY, AND M. MORE Abstract. In 1952, Heinrich Scholz published a question in the Journal of Sym- bolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G¨unter Asser asked whether the complement of a spectrum is always a spectrum. These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity. In this paper we survey developments over the last 50-odd years pertaining to the spectrum problem. Our presentation follows conceptual devel- opments rather than the chronological order. Originally a number theoretic problem, it has been approached in terms of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally in terms of structural graph theory. Although Scholz’ question was answered in various ways, Asser’s question remains open. One appendix paraphrases the contents of several early and not easily accesible papers by G. Asser, A. Mostowski, J. Bennett and S. Mo. Another appendix contains a compendium of questions and conjectures which remain open. To be submitted to the Bulletin of Symbolic Logic. July 17, 2009 (version 13.2) Contents 1. Introduction 3 2. The Emergence of the Spectrum Problem 4 2.1. Scholz’s problem 4 2.2. Basic facts and questions 5 2.3. Immediate responses to H. Scholz’s problem 6 2.4. Approaches and themes 8 3. Understanding Spectra: counting functions and number theory 12 3.1.
    [Show full text]
  • The Spectrum Problem and Parikh's Theorem
    Bombay'07 Spectrum The spectrum problem and Parikh's theorem For R. Parikh at his 70th birthday by J.A. Makowsky Department of Computer Science Technion - Israel Institute of Technology Haifa, Israel [email protected] http://cs.technion.ac.il/∼janos In collaboration with A. Durand, M. More and N. Jones 1 Bombay'07 Spectrum Acknowledgements For the early history: Egon B¨orger, Spektralproblem and Completeness of Logical Decision Problems, LNCS vol. 171 (1984), pp. 333- 356. For my renewed interest in the Spectrum Problem and inspiration: Yuri Gurevich and Saharon Shelah, Spectra of Monadic Second Order Formulas with One Unary Function, LiCS 2003. For collaboration: Eldar Fischer and Johann Makowsky, On Spectra of Sentences of Monadic Second Order Logic with Counting, Journal of Symbolic Logic, 69.3 (2004) pp. 617-640 Bruno Courcelle and Johann Makowsky, Fusion in Relational Structures and the Verification of Monadic Second Order Properties, Mathematical Structures in Computer Science, vol. 12.2 (2002) pp. 203-235 and to R. Fagin, for comments on earlier draft slides of this talk. 2 Bombay'07 Spectrum Outline • From Kalm´ar to Grzegorczyk • The spectrum problem • Approach I: Recursion Theory • Interlude: Parikh's Theorem • Approach II: Complexity Theory • Approach III: Restricted vocabularies • Approach IV: Structures of bounded width 201 Bombay'07 Spectrum L´aszl´o Kalm´ar 1905-1976 In this talk the Kalm´ar-Csillag class, introduced in 1943, of low-complexity recursive functions, the Elementary functions E play a certain r^ole. E is the smallest class of functions f : N ! N, containing successor, addition, difference, and which is closed under substitution, indexed sums x f(y¯; x) = X g(y¯; z) z and products x h(y¯; x) = Y g(y¯; z) z E¯ is the class of sets X ⊆ N, with their characteristic functions in E.
    [Show full text]
  • Fifty Years of the Spectrum Problem: Survey and New Results
    FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS A. DURAND, N. D. JONES, J. A. MAKOWSKY, AND M. MORE Abstract. In 1952, Heinrich Scholz published a question in the Journal of Sym- bolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G¨unter Asser asked whether the complement of a spectrum is always a spectrum. These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity. In this paper we survey developments over the last 50-odd years pertaining to the spectrum problem. Our presentation follows conceptual devel- opments rather than the chronological order. Originally a number theoretic problem, it has been approached in terms of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally in terms of structural graph theory. Although Scholz’ question was answered in various ways, Asser’s question remains open. One appendix paraphrases the contents of several early and not easily accesible papers by G. Asser, A. Mostowski, J. Bennett and S. Mo. Another appendix contains a compendium of questions and conjectures which remain open. To be submitted to the Bulletin of Symbolic Logic. January 23, 2018 (version 13.2) Contents 1. Introduction 3 2. The Emergence of the Spectrum Problem 4 2.1. Scholz’s problem 4 2.2. Basic facts and questions 5 arXiv:0907.5495v1 [math.LO] 31 Jul 2009 2.3. Immediate responses to H. Scholz’s problem 6 2.4.
    [Show full text]
  • Limiting Cases for Spectrum Closure Results
    Limiting Cases for Spectrum Closure Results Aaron Hunter Simon Fraser University Burnaby, Canada, V5A 1S6 October 18, 2004 Abstract: The spectrum of a first-order sentence is the set of cardinalities of its finite models. Given a spectrum S and a function f, it is not always clear whether or not the image of S under f is also a spectrum. In this paper, we consider questions of this form for functions that increase very quickly and for functions that increase very slowly. Roughly speaking, we prove that the class of all spectra is closed under functions that increase arbitrarily quickly, but it is not closed under some natural slowly increasing functions. 1 Introduction 1.1 Spectrum Closure Results The spectrum of a first-order sentence φ is the set of cardinalities of its finite models. Let Sp(φ) denote the spectrum of φ and let SPEC denote the set of all spectra of first-order sentences. Given a set S of natural numbers and a function f, we write f(S) as an abbreviation for {f(n): n ∈ S}. Let S ⊆ SPEC. We say that S is closed under f if f(S) ∈ S whenever S ∈ S. In this paper, we study closure results for SPEC under functions that in- crease very rapidly and functions that increase very slowly. Our main result is that SPEC is closed under functions that increase arbitrarily quickly, but it is not closed under some natural slowly increasing functions. We prove all of our results using elementary model-theoretic constructions. 1 1.2 Definitions and Notation We assume that the reader is familiar with basic model theory as set out, for example, in [2].
    [Show full text]
  • Spectrum of a Sentence
    Notes prepared by Stanley Burris March 13, 2001 Spectrum of a sentence In 1952 Scholz asked about the possibilities for the set of sizes of the ¯nite models of a ¯rst-order sentence. DEFINITION 1 Given a ¯rst-order sentence ' de¯ne the spectrum of ' to be the set fjAj : A j= '; A ¯niteg. Let us look at some examples of spectra. EXAMPLE 2 The set of powers of primes is a spectrum: take the state- ment de¯ning ¯elds. EXAMPLE 3 The set of even numbers is a spectrum: take the statement 8x(x ¼6 f(x) ^ x ¼ f(f(x))). An interesting set of models is obtained by using a modi¯cation of Dedekind's approach to the natural numbers, namely let our language be 0 f+; £; ·; ; 2; b; cg and let '0 be the conjunction of the statements: ² 8x x · x 8x8y x · y ^ y · x =) x ¼ y 8x8y8z x · y ^ y · z =) x · z [· is a linear ordering] ² 8x 2 · x ^ x · c [2 is the smallest element, c the largest element] ² x < c =) x < x0 [0 is strictly increasing on the elements less than c] ² c0 ¼ c ^ b < c ^ b0 ¼ c ² 8x8y y · x _ x0 · y [there are no elements between x and x0] ² 8x x + 2 ¼ x00 1 ² 8x8y x + y0 ¼ (x + y)0 ² 8x8y x £ 2 ¼ x + x ² 8x8y x £ y0 ¼ (x £ y) + x One can see that for each natural number n > 1 there is one model (up to isomorphism) of size n, and it looks like the numbers greater than 1 with the usual ordering · and operations +; £;0, with the numbers ¸ n + 1 collapsed into the single number n+1, which is the element labelled c, and n is labelled b.
    [Show full text]
  • Open Problems in Finite Model Theory
    Problems in Finite Model Theory Last updated August 21, 2003 Bedlewo 2003 Luminy 2000 Oberwolfach 1998 Luminy 1995 Oberwolfach 1994 ❊❊❊ Maintained by Dietmar Berwanger and Erich Gr¨adel These pages contain a compilation of open problems in finite model theory, and, when solved, their solutions. The most recent version can be obtained on the Finite Model Theory homepage: www-mgi.informatik.rwth-aachen.de/FMT. Subscriptions, new problems and announcements of solu- tions can be sent at any time to Dietmar Berwanger [email protected], or Erich Gr¨adel [email protected]. Contributions should be set preferably in LATEX and not exceed half a page (problems) or a page (solutions). Any other updates are also welcome, e.g., references, when the announced solutions appear in print. Contents 1 Bedlewo 2003 1 1.1 Fixed-pointlogicwithcounting . ... 1 Andreas Blass 1.2 Monadic second-order transductions . .... 1 Bruno Courcelle 1.3 Monadic second-order logic with cardinality predicates ........... 2 Bruno Courcelle 1.4 ESOarityhierarchy .............................. 3 Etienne Grandjean 1.5 A gap in the complexity of natural problems . .... 3 Etienne Grandjean 1.6 Three open problems concerning dynamic complexity . ........ 4 Neil Immerman 1.7 Frail0-1laws .................................. 4 Jean-Marie Le Bars 1.8 Random graphs with specified degree sequence . .... 5 Jim Lynch 1.9 ArityofLFP-queries .............................. 6 Greg McColm 1.10Genericqueries ................................. 7 Luc Segoufin 1.11 Locallygenericqueries . ... 7 Michael Abram Taitslin 1.12 Bracketing-invariantproperties . ...... 8 Jan Van den Bussche 1.13 A partial (negative) answer to Specker’s problem . ......... 8 Janos A. Makowsky, Eldar Fischer 1.14 New results concerning Ash’s Conjecture .
    [Show full text]
  • The Complexity of Bayesian Networks Specified by Propositional
    The Complexity of Bayesian Networks Specified by Propositional and Relational Languages Fabio G. Cozman Denis D. Mauá Escola Politécnica Instituto de Matemática Universidade de São Paulo e Estatística Universidade de São Paulo December 5, 2016 Abstract We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inferential and the combined complexity), when the network is fixed and query and domain are the input (the query/data complexity), and when the network and query are fixed and the domain is the input (the domain complexity). We draw connections with probabilistic databases and liftability results, and obtain complexity classes that range from polynomial to exponential levels. 1 Introduction A Bayesian network can represent any distribution over a given set of random variables [36, 71], and this flexibility has been used to great effect in many applications [109]. Indeed, Bayesian networks are routinely used to carry both deterministic and probabilistic assertions in a variety of knowledge representation tasks. Many of these tasks contain complex decision problems, with repetitive patterns of entities and relationships. Thus it is not surprising that practical concerns have led to modeling languages where Bayesian networks are specified using relations, logical variables, and quantifiers [49, 111]. Some of these languages enlarge Bayesian networks with plates [50, 85], while others resort to elements of database schema [47, 60]; some others mix probabilities with logic programming [106, 118] arXiv:1612.01120v3 [cs.AI] 6 Jan 2017 and even with functional programming [87, 89, 102].
    [Show full text]
  • Spectra and Systems of Equations
    Contemporary Mathematics Spectra and Systems of Equations Jason P. Bell, Stanley N. Burris, and Karen Yeats Abstract. Periodicity properties of sets of nonnegative integers, defined by systems Y = G(Y) of equations, are analyzed. Such systems of set equa- tions arise naturally from equational specifications of combinatorial classes| Compton's equational specification of monadic second order classes of trees is an important example. In addition to the general theory of set equations and periodicity, with several small illustrative examples, two applications are given: (1) There is a new proof of the fundamental result of Gurevich and Shelah on the periodicity of monadic second order classes of finite monounary algebras. Also there is a new proof that the monadic second order theory of finite monounary algebras is decidable. (2) A formula derived for the periodicity parameter q is used in the deter- mination of the asymptotics for the coefficients of generating functions defined by well conditioned systems of equations. 1. Introduction Logicians have developed the subject of finite model theory to study classes of finite structures defined by sentences in a formal logic. (In logic, a structure is a set equipped with a selection of functions and/or relations and/or constants.) Combinatorialists have been interested in classes of objects defined by equational specifications (the objects are not restricted to the structures studied by logicians). In recent years, there has been an increasing interest in the study of specifications involving several equations, and this article continues these investigations. Back- ground, definitions, and an introduction to the topics are given in x1.1{x1.4.
    [Show full text]