Information and Computation最新文献_第2页

Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-02-13 DOI: 10.1016/j.ic.2025.105282

Yasuaki Kobayashi , Kazuhiro Kurita , Kunihiro Wasa

{"title":"Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond","authors":"Yasuaki Kobayashi , Kazuhiro Kurita , Kunihiro Wasa","doi":"10.1016/j.ic.2025.105282","DOIUrl":"10.1016/j.ic.2025.105282","url":null,"abstract":"<div><div>Finding a <em>maximum</em> cardinality common independent set in two matroids (also known as <span>Matroid Intersection</span>) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum bipartite matching, a maximum colorful forest, and an arborescence in directed graphs. Enumerating all <em>maximal</em> common independent sets in two (or more) matroids is a classical enumeration problem. In this paper, we address an “intersection” of these problems: Given two matroids and a threshold <em>τ</em>, the goal is to enumerate all maximal common independent sets in the matroids with cardinality at least <em>τ</em>. We show that this problem can be solved in polynomial delay and polynomial space. Moreover, our technique can be extended to a more general problem, which is relevant to <span>Matroid Matching</span>. We give a polynomial-delay and polynomial-space algorithm for enumerating all maximal “matchings” with cardinality at least <em>τ</em>, assuming that the optimization counterpart is “tractable” in a certain sense. This extension allows us to enumerate small minimal connected vertex covers in subcubic graphs. We also discuss a framework to convert enumeration with cardinality constraints into ranked enumeration.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105282"},"PeriodicalIF":0.8,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437890","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}

引用次数: 0

Homogeneous spiking neural P systems with synaptic failure

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-02-10 DOI: 10.1016/j.ic.2025.105281

Luping Zhang , Tingfang Wu

{"title":"Homogeneous spiking neural P systems with synaptic failure","authors":"Luping Zhang , Tingfang Wu","doi":"10.1016/j.ic.2025.105281","DOIUrl":"10.1016/j.ic.2025.105281","url":null,"abstract":"<div><div>Spiking neural P (SN P) systems are a class of neural-like computational models, inspired by the way biological neurons process information through electrical impulses known as spikes. Homogeneous spiking neural P (HSN P) systems are a specialized variant of SN P systems, where all neurons share the same set of rules. In this work, with the biological inspiration that excessive synaptic transmission can lead to short-term failures in signal delivery between neurons in neural systems, the notion of synaptic failure is considered in HSN P systems, termed HSN P systems with synaptic failure (HSNPSF systems). Specifically, synaptic failure is referred to a family of sets of failure-prone synapses: if spikes simultaneously pass along all the synapses in such a set, the transmitted spikes across the synapses are suppressed; if a synapse in the set does not transmit any spike, the spikes pass along the synapses at that time, ultimately reaching the destination neurons. The computational power of HSNPSF systems is investigated by proving that they can achieve computational completeness both in generating and accepting modes. Furthermore, the computational efficiency of HSNPSF systems is examined, and it is demonstrated that with the help of non-deterministic feature, these systems are capable of solving <strong>NP</strong>-complete (the Subset Sum) problem in a semi-uniform way and within constant time.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105281"},"PeriodicalIF":0.8,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143420489","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}

引用次数: 0

On the computational power of energy-constrained mobile robots

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-02-07 DOI: 10.1016/j.ic.2025.105280

Kevin Buchin , Paola Flocchini , Irina Kostitsyna , Tom Peters , Nicola Santoro , Koichi Wada

{"title":"On the computational power of energy-constrained mobile robots","authors":"Kevin Buchin , Paola Flocchini , Irina Kostitsyna , Tom Peters , Nicola Santoro , Koichi Wada","doi":"10.1016/j.ic.2025.105280","DOIUrl":"10.1016/j.ic.2025.105280","url":null,"abstract":"<div><div>We consider distributed systems of autonomous robots operating in the plane under synchronous <em>Look</em>-<em>Compute</em>-<em>Move</em> (<em>LCM</em>) cycles. Prior research on four distinct models assumes robots have unlimited energy. We remove this assumption and investigate systems where robots have limited but renewable energy, requiring inactivity for energy restoration.</div><div>We analyze the computational impact of this constraint, fully characterizing the relationship between energy-restricted and unrestricted robots. Surprisingly, we show that energy constraints can enhance computational power.</div><div>Additionally, we study how memory persistence and communication capabilities influence computation under energy constraints. By comparing the four models in this setting, we establish a complete characterization of their computational relationships.</div><div>A key insight is that energy-limited robots can be modeled as unlimited-energy robots controlled by an adversarial activation scheduler. This provides a novel equivalence framework for analyzing energy-constrained distributed systems.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105280"},"PeriodicalIF":0.8,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387342","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}

引用次数: 0

On regular trees defined from unfoldings and coverings

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-31 DOI: 10.1016/j.ic.2025.105278

Bruno Courcelle

引用次数: 0

Consistent query answering in multi-relation databases

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-31 DOI: 10.1016/j.ic.2025.105279

Dominique Laurent , Nicolas Spyratos

{"title":"Consistent query answering in multi-relation databases","authors":"Dominique Laurent , Nicolas Spyratos","doi":"10.1016/j.ic.2025.105279","DOIUrl":"10.1016/j.ic.2025.105279","url":null,"abstract":"<div><div>Traditionally, to verify the consistency of a multi-relation database with respect to a set of functional dependencies, one applies the well-known Chase algorithm, which derives new tuples as long as no conflict with some dependency arises. Therefore, the Chase algorithm uses dependencies both as inference rules and as tools to check consistency. If no conflicts occur, the database is declared consistent else inconsistent. If the database is consistent then query answering proceeds as usual, otherwise extracting consistent information from the inconsistent database is an issue, known as consistent query answering.</div><div>To address this issue, we consider the set <span><math><mi>T</mi></math></span> of all tuples built from constants occurring in the database, and we use set theoretic semantics to characterize tuples in <span><math><mi>T</mi></math></span> in two orthogonal ways: true/false and conflicting/non-conflicting. Calling ‘consistent’ a tuple which is true and non-conflicting, a ‘repair’ is defined to be a maximal subset of true tuples that satisfies the dependencies and in which as many consitent tuples as possible are true. A query <em>Q</em> is of the form <span>select</span> <em>X</em> <span>where</span> <span><math><mi>C</mi><mi>o</mi><mi>n</mi><mi>d</mi><mi>i</mi><mi>t</mi><mi>i</mi><mi>o</mi><mi>n</mi></math></span>, and a tuple <em>x</em> of <span><math><mi>T</mi></math></span> is in the consistent answer of <em>Q</em> if <em>x</em> is in the answer of <em>Q</em> in every repair.</div><div>Our main contributions are: (a) a novel approach to consistent query answering in multi-relation databases; (b) a modified Chase algorithm to compute true/false and conflicting/non-conflicting tuples; (c) for acyclic functional dependencies, a polynomial-time algorithm computing the exact or approximate consistent answers; (d) a detailed discussion comparing our approach with other related approaches.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105279"},"PeriodicalIF":0.8,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143376960","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}

引用次数: 0

The computational properties of P systems with mutative membrane structures

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-27 DOI: 10.1016/j.ic.2025.105277

Bosheng Song , Chuanlong Hu , David Orellana-Martín , Antonio Ramírez-de-Arellano , Mario J. Pérez-Jiménez , Xiangxiang Zeng

引用次数: 0

Metric quantifiers and counting in timed logics and automata

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-17 DOI: 10.1016/j.ic.2025.105268

Hsi-Ming Ho , Khushraj Madnani

{"title":"Metric quantifiers and counting in timed logics and automata","authors":"Hsi-Ming Ho , Khushraj Madnani","doi":"10.1016/j.ic.2025.105268","DOIUrl":"10.1016/j.ic.2025.105268","url":null,"abstract":"<div><div>We study the expressiveness of the <em>pointwise</em> interpretations (i.e. over timed words) of some predicate and temporal logics with metric and counting features. We show that counting in the unit interval <span><math><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span> is strictly weaker than counting in <span><math><mo>(</mo><mn>0</mn><mo>,</mo><mi>b</mi><mo>)</mo></math></span> with arbitrary <span><math><mi>b</mi><mo>≥</mo><mn>0</mn></math></span>; moreover, allowing the latter to be included in temporal logics leads to expressive completeness for the metric predicate logic <span>Q2MLO</span>, recovering the corresponding result for the continuous interpretations (i.e. over signals). Exploiting this connection, we show that in contrast to the continuous case, adding ‘punctual’ predicates into <span>Q2MLO</span> is still insufficient for the full expressive power of the Monadic First-Order Logic of Order and Metric (<span>FO[</span><span><math><mo><</mo><mo>,</mo><mo>+</mo><mn>1</mn></math></span><span>]</span>); as a remedy, we propose a generalisation of the recently proposed Pnueli automata modalities and show that the resulting metric temporal logic is expressively complete for <span>FO[</span><span><math><mo><</mo><mo>,</mo><mo>+</mo><mn>1</mn></math></span><span>]</span>. On the practical side, we propose a <em>compositional</em> construction from metric interval temporal logic with counting or similar extensions to timed automata, which is more amenable to implementation based on existing tools that support on-the-fly model checking.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105268"},"PeriodicalIF":0.8,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100250","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}

引用次数: 0

Generalising the maximum independent set algorithm via Boolean networks

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-17 DOI: 10.1016/j.ic.2025.105266

Maximilien Gadouleau, David C. Kutner

{"title":"Generalising the maximum independent set algorithm via Boolean networks","authors":"Maximilien Gadouleau, David C. Kutner","doi":"10.1016/j.ic.2025.105266","DOIUrl":"10.1016/j.ic.2025.105266","url":null,"abstract":"<div><div>A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider (the complexity of decision problems related to) the generalisation of this MIS algorithm wherein any starting set is allowed. Two main approaches are leveraged. Firstly, we view the MIS algorithm as a sequential update of a Boolean network according to a permutation of the vertex set. Secondly, we introduce the concept of a constituency of a graph: a set of vertices that is dominated by an independent set. Recognizing a constituency is <strong>NP</strong>-complete, a fact we leverage repeatedly in our investigation.</div><div>Our contributions are multiple: we establish that deciding whether all maximal independent sets can be reached from some configuration is <strong>coNP</strong>-complete; that fixing words (which reach a MIS from any starting configuration) and fixing permutations (briefly, permises) are <strong>coNP</strong>-complete to recognize; and that permissible graphs (graphs with a permis) are <strong>coNP</strong>-hard to recognize. We also exhibit large classes of permissible and non-permissible graphs, notably near-comparability graphs which may be of independent interest.</div><div>Lastly, we extend our study to digraphs, where we search for kernels. Since the natural generalisation of our approach may not necessarily find a kernel, we introduce two further Boolean networks for digraphs: one always finds an independent set, and the other always finds a dominating set.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105266"},"PeriodicalIF":0.8,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100251","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}

引用次数: 0

Efficient assignment of identities in anonymous populations

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-08 DOI: 10.1016/j.ic.2025.105265

Leszek Gąsieniec , Jesper Jansson , Christos Levcopoulos , Andrzej Lingas

{"title":"Efficient assignment of identities in anonymous populations","authors":"Leszek Gąsieniec , Jesper Jansson , Christos Levcopoulos , Andrzej Lingas","doi":"10.1016/j.ic.2025.105265","DOIUrl":"10.1016/j.ic.2025.105265","url":null,"abstract":"<div><div>We consider the fundamental problem of assigning distinct labels to agents in the probabilistic model of population protocols. Our protocols operate under the assumption that the size <em>n</em> of the population is embedded in the transition function. W.h.p. (with high probability), they are silent, i.e., eventually each agent reaches its final state and remains in it forever, and they are safe, i.e., never change a label that has already been assigned to an agent. We provide efficient protocols for this problem complemented with tight lower bounds. Our fast labeling protocol uses only <span><math><mi>O</mi><mo>(</mo><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo><mo>/</mo><mi>ε</mi><mo>)</mo></math></span> interactions w.h.p., <span><math><mo>(</mo><mn>2</mn><mo>+</mo><mi>ε</mi><mo>)</mo><mi>n</mi><mo>+</mo><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>a</mi></mrow></msup><mo>)</mo></math></span> states, and the label range <span><math><mo>[</mo><mn>1</mn><mo>,</mo><mo>(</mo><mn>1</mn><mo>+</mo><mi>ε</mi><mo>)</mo><mi>n</mi><mo>]</mo></math></span>, where <span><math><mn>1</mn><mo>≥</mo><mi>ε</mi><mo>></mo><mn>0</mn></math></span> and <span><math><mn>0</mn><mo><</mo><mi>a</mi><mo><</mo><mn>1</mn></math></span>, while our nearly state-optimal protocol uses only <span><math><mi>n</mi><mo>+</mo><mn>5</mn><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>+</mo><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> states, the label range <span><math><mo>[</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>]</mo></math></span>, and w.h.p., <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span> interactions.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105265"},"PeriodicalIF":0.8,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100140","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}

引用次数: 0

Approximate envy-freeness in indivisible resource allocation with budget constraints

IF 0.8 4区计算机科学

Information and Computation Pub Date : 2025-01-03 DOI: 10.1016/j.ic.2024.105264

Xiaowei Wu , Bo Li , Jiarui Gan

{"title":"Approximate envy-freeness in indivisible resource allocation with budget constraints","authors":"Xiaowei Wu , Bo Li , Jiarui Gan","doi":"10.1016/j.ic.2024.105264","DOIUrl":"10.1016/j.ic.2024.105264","url":null,"abstract":"<div><div>We study the fair allocation of indivisible resources under knapsack constraints, where a set of items with varied costs and values are to be allocated among a group of agents. Each agent has a budget constraint on the total cost of items she can receive. The goal is to compute a budget-feasible allocation that is <em>envy-free</em> (EF), in which the agents do not envy each other for the items they receive, nor do they envy a charity, which is endowed with all the unallocated items. Since EF allocations barely exist (even without the budget constraints), we are interested in the relaxed notion of <em>envy-freeness up to one item</em> (EF1). Our results are twofold. Firstly, for the general setting where agents have heterogeneous valuations and budgets, we show that a budget-feasible allocation that maximizes the <em>Nash social welfare</em> (NSW) achieves a 1/4-approximation of EF1. This approximation ratio carries to the general case of arbitrary monotone subadditive valuations. The approximation ratio improves gracefully when the items have small cost compared with the agents' budgets; it converges to 1/2 when the budget-cost ratio approaches infinity, and to 1 if the agents further have identical valuations. Secondly, when agents have identical valuations, we design a polynomial-time algorithm that computes a 1/2-approximate EF1 allocation for an arbitrary number of agents. For the case of identical agents and the case of two agents, we propose polynomial-time algorithms for computing EF1 allocations.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"303 ","pages":"Article 105264"},"PeriodicalIF":0.8,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100139","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}

引用次数: 0