Information and Computation最新文献

{"title":"On prime scenarios in qualitative spatial and temporal reasoning","authors":"Yakoub Salhi ,&nbsp;Michael Sioutis","doi":"10.1016/j.ic.2024.105198","DOIUrl":"10.1016/j.ic.2024.105198","url":null,"abstract":"<div><p>The concept of prime implicant is a fundamental tool in Boolean algebra, which is used in Boolean circuit design and, recently, in explainable AI. This study investigates an analogous concept in qualitative spatial and temporal reasoning, called prime scenario. Specifically, we define a prime scenario of a qualitative constraint network (QCN) as a minimal set of decisions that can uniquely determine solutions of this QCN. We propose in this paper a collection of algorithms designed to address various problems related to prime scenarios, and also show how certain results can be useful for measuring the robustness of a QCN. In addition, we study the relationship between our notions in this paper and the notion of prime sub-QCN in the literature, and establish theoretical results in the process. Further, we devise a language based on the notion of prime scenario for knowledge compilation. Finally, an experimental evaluation is performed with instances of Allen's Interval Algebra and <span>RCC8</span> to assess the efficiency of our algorithms and, hence, also the difficulty of the newly introduced problems here.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105198"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On parallelisms of PG(3,4) with automorphisms of order 2","authors":"Anton Betten ,&nbsp;Svetlana Topalova ,&nbsp;Stela Zhelezova","doi":"10.1016/j.ic.2024.105201","DOIUrl":"10.1016/j.ic.2024.105201","url":null,"abstract":"<div><p>Let <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span> be the <em>n</em>-dimensional projective space over the finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>. A <em>spread</em> in <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span> is a set of mutually skew lines which partition the point set. A <em>parallelism</em> is a partition of the set of lines by spreads. The classification of parallelisms in small finite projective spaces is of interest for problems from projective geometry, design theory, network coding, error-correcting codes, and cryptography. All parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span> and <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>3</mn><mo>)</mo></math></span> are known. Parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> which are invariant under automorphisms of odd prime orders have also been classified. The present paper contributes to the classification of parallelisms in <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> with automorphisms of even order. We focus on cyclic groups of order four and the group of order two generated by a Baer involution. We examine invariants of the parallelisms such as the full automorphism group, the type of spreads and questions of duality. The results given in this paper show that the number of parallelisms of <span><math><mrow><mi>PG</mi></mrow><mo>(</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></math></span> is at least 8675365. Some future directions of research are outlined.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105201"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Detecting arrays for effects of multiple interacting factors","authors":"Charles J. Colbourn,&nbsp;Violet R. Syrotiuk","doi":"10.1016/j.ic.2024.105202","DOIUrl":"10.1016/j.ic.2024.105202","url":null,"abstract":"<div><p>Detecting arrays provide test suites for complex engineered systems in which many factors interact. The determination of which interactions have a significant impact on system behaviour requires not only that each interaction appear in a test, but also that its effect can be distinguished from those of other significant interactions. In this paper, compact representations of detecting arrays using vectors over the finite field are developed. Covering strong separating hash families exploit linear independence over the field, while the weaker elongated covering perfect hash families permit some linear dependence. For both, probabilistic analyses are employed to establish effective upper bounds on the number of tests needed in a detecting array for a wide variety of parameters. The analyses underlie efficient algorithms for the explicit construction of detecting arrays.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105202"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141979194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Attacking (EC)DSA with partially known multiples of nonces","authors":"Marios Adamoudis ,&nbsp;Konstantinos A. Draziotis ,&nbsp;Dimitrios Poulakis","doi":"10.1016/j.ic.2024.105203","DOIUrl":"10.1016/j.ic.2024.105203","url":null,"abstract":"<div><p>In this paper, we introduce a series of attacks on DSA schemes that, under certain assumptions, can expose the secret key when one or more signed messages are accessible. By utilizing these signed messages, we construct a system of linear congruences with at most one solution smaller than a specific bound, which can be efficiently determined using Babai's Nearest Plane Algorithm. As a case study, we provide a successful attack on secp161k1, assuming that a particular multiple of an ephemeral key is 161 bits long.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105203"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Regular languages as images of local functions over small alphabets","authors":"Stefano Crespi Reghizzi ,&nbsp;Pierluigi San Pietro","doi":"10.1016/j.ic.2024.105206","DOIUrl":"10.1016/j.ic.2024.105206","url":null,"abstract":"<div><p>The characterization (a.k.a. Medvedev theorem) of regular languages as homomorphic letter-to-letter image of local languages, over an alphabet of cardinality depending on the recognizer size, is extended by using strictly locally testable (<em>k</em>-slt) languages, <span><math><mi>k</mi><mo>&gt;</mo><mn>1</mn></math></span>, and a local rational function instead of a homomorphism.</p><p>By encoding DFA computations via comma-free codes, we prove that regular languages are the output of quasi-length-preserving local functions, defined on alphabets with one more letter than in the language. A binary alphabet suffices if the local function is allowed to shorten input length, or if the regular language has polynomial density.</p><p>If local relations are considered instead of functions, a binary input alphabet suffices for any regular language. A new simpler proof is then obtained of the extension of Medvedev's theorem stating that any regular language is the homomorphic image of an slt language over an alphabet of double size.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105206"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Maximal diameter of integral circulant graphs","authors":"Milan Bašić ,&nbsp;Aleksandar Ilić ,&nbsp;Aleksandar Stamenković","doi":"10.1016/j.ic.2024.105208","DOIUrl":"10.1016/j.ic.2024.105208","url":null,"abstract":"<div><p>Integral circulant graphs are proposed as models for quantum spin networks enabling perfect state transfer. Understanding the potential information transfer between nodes in such networks involves calculating the maximal graph diameter. The integral circulant graph <span><math><msub><mrow><mi>ICG</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>D</mi><mo>)</mo></math></span> has vertex set <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>=</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>}</mo></math></span>, with vertices <em>a</em> and <em>b</em> adjacent if <span><math><mi>gcd</mi><mo>⁡</mo><mo>(</mo><mi>a</mi><mo>−</mo><mi>b</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>∈</mo><mi>D</mi></math></span>, where <span><math><mi>D</mi><mo>⊆</mo><mo>{</mo><mi>d</mi><mo>:</mo><mi>d</mi><mo>|</mo><mi>n</mi><mo>,</mo><mspace></mspace><mn>1</mn><mo>≤</mo><mi>d</mi><mo>&lt;</mo><mi>n</mi><mo>}</mo></math></span>. Building on the upper bound <span><math><mn>2</mn><mo>|</mo><mi>D</mi><mo>|</mo><mo>+</mo><mn>1</mn></math></span> for the diameter provided by Saxena, Severini, and Shparlinski, we prove that the maximal diameter of <span><math><msub><mrow><mi>ICG</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>D</mi><mo>)</mo></math></span> for a given order <em>n</em> with prime factorization <span><math><msubsup><mrow><mi>p</mi></mrow><mrow><mn>1</mn></mrow><mrow><msub><mrow><mi>α</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msubsup><mo>⋯</mo><msubsup><mrow><mi>p</mi></mrow><mrow><mi>k</mi></mrow><mrow><msub><mrow><mi>α</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msubsup></math></span> is <span><math><mi>r</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> or <span><math><mi>r</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>+</mo><mn>1</mn></math></span>, where <span><math><mi>r</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mi>k</mi><mo>+</mo><mo>|</mo><mo>{</mo><mi>i</mi><mspace></mspace><mo>|</mo><msub><mrow><mi>α</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>&gt;</mo><mn>1</mn><mo>,</mo><mspace></mspace><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>k</mi><mo>}</mo><mo>|</mo></math></span>. We show that a divisor set <em>D</em> with <span><math><mo>|</mo><mi>D</mi><mo>|</mo><mo>≤</mo><mi>k</mi></math></span> achieves this bound. We calculate the maximal diameter for graphs of order <em>n</em> and divisor set cardinality <span><math><mi>t</mi><mo>≤</mo><mi>k</mi></math></span>, identifying all extremal graphs and improving the previous upper bound.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105208"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rational weighted tree languages with storage","authors":"Frederic Dörband ,&nbsp;Zoltán Fülöp ,&nbsp;Heiko Vogler","doi":"10.1016/j.ic.2024.105205","DOIUrl":"10.1016/j.ic.2024.105205","url":null,"abstract":"<div><p>We define the class of rational weighted tree languages with storage over complete, not necessarily commutative, semirings and we repeat its characterization by weighted regular tree grammars with storage. Moreover, we show an alternative proof of the fact that the class of rational weighted tree languages with storage is closed under the rational operations, i.e., top-concatenation, scalar multiplication, sum, tree concatenation, and Kleene-star, where the latter two closure results require that the storage has a reset instruction.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105205"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Zeroing neural network based on the equation AXA = A","authors":"Marko D. Petković,&nbsp;Predrag S. Stanimirović","doi":"10.1016/j.ic.2024.105207","DOIUrl":"10.1016/j.ic.2024.105207","url":null,"abstract":"<div><p>According to available scientific research, there is no information that Zeroing Neural Network (ZNN) models for calculating the matrix inverse and generalized inverses have been studied on the basis of Penrose equations. Our intention is to present a new ZNN design which defined on the Penrose matrix equations and whose intention is to find the time-variant matrix inverse and pseudoinverse. We propose a novel Zeroing function (ZF) based on the first Penrose equation <span><math><mi>A</mi><mi>X</mi><mi>A</mi><mo>=</mo><mi>A</mi></math></span>. The initiated ZNN design for computing the time-varying inverse and the pseudoinverse is defined and investigated. An explicit form of the defined model is also proposed. The convergence properties of the proposed explicit dynamics are investigated in both the time-invariant and time-varying case. Illustrative simulation results are given in order to verify the obtained theoretical results.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"301 ","pages":"Article 105207"},"PeriodicalIF":0.8,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games","authors":"Rui Yan ,&nbsp;Gabriel Santos ,&nbsp;Gethin Norman ,&nbsp;David Parker ,&nbsp;Marta Kwiatkowska","doi":"10.1016/j.ic.2024.105193","DOIUrl":"10.1016/j.ic.2024.105193","url":null,"abstract":"<div><p>Neuro-symbolic approaches to artificial intelligence, which combine neural networks with classical symbolic techniques, are growing in prominence, necessitating formal approaches to reason about their correctness. We propose a novel modelling formalism called neuro-symbolic concurrent stochastic games (NS-CSGs), which comprise two probabilistic finite-state agents interacting in a shared continuous-state environment. Each agent observes the environment using a neural perception mechanism, which converts inputs such as images into symbolic percepts, and makes decisions symbolically. We focus on the class of NS-CSGs with Borel state spaces and prove the existence and measurability of the value function for zero-sum discounted cumulative rewards under piecewise-constant restrictions. To compute values and synthesise strategies, we first introduce a Borel measurable piecewise-constant (B-PWC) representation of value functions and propose a B-PWC value iteration. Second, we introduce two novel representations for the value functions and strategies, and propose a minimax-action-free policy iteration based on alternating player choices.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105193"},"PeriodicalIF":0.8,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000580/pdfft?md5=324958787cd624f11d92ad65e9802849&pid=1-s2.0-S0890540124000580-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum temporal logic and reachability problems of matrix semigroups","authors":"Nengkun Yu","doi":"10.1016/j.ic.2024.105197","DOIUrl":"10.1016/j.ic.2024.105197","url":null,"abstract":"<div><p>We study the reachability problems of a quantum finite automaton. More precisely, we introduce quantum temporal logic (QTL) that specifies the time-dependent behavior of quantum finite automaton by presenting the time dependence of events temporal operators ◊ (eventually) and □ (always) and employing the projections on subspaces as atomic propositions. The satisfiability of QTL formulae corresponds to various reachability problems of matrix semigroups. We prove that the satisfiability problems for <span><math><mo>□</mo><msubsup><mrow><mo>∨</mo></mrow><mrow><mi>i</mi></mrow><mrow><mi>m</mi></mrow></msubsup><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, <span><math><mo>◊</mo><mo>□</mo><msubsup><mrow><mo>∨</mo></mrow><mrow><mi>i</mi></mrow><mrow><mi>m</mi></mrow></msubsup><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> and <span><math><mo>□</mo><mo>◊</mo><msubsup><mrow><mo>∨</mo></mrow><mrow><mi>i</mi></mrow><mrow><mi>m</mi></mrow></msubsup><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> with atomic propositions <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> are decidable. This result solves the open problem of Li and Ying 2014. Notably, the decidability of <span><math><mo>□</mo><mo>◊</mo><mi>p</mi></math></span> can be interpreted as a generalization of Skolem-Mahler-Lech's celebrated theorem based on additive number theory. This paper's last part shows how the quantum finite automaton can model the general concurrent quantum programs, which may involve an arbitrary classical control flow.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105197"},"PeriodicalIF":0.8,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141844019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}