No Efficient Disjunction or Conjunction of Switch-Lists-Reference-Cited by-同舟云学术

No Efficient Disjunction or Conjunction of Switch-Lists

Published:2022-04-26 Issue:1 Volume:13 Page:1-4
ISSN:1574-0617
Container-title:Journal on Satisfiability, Boolean Modeling and Computation
language:
Short-container-title:SAT

Author:

Mengel Stefan¹

Affiliation:

1. Université d’Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL), Lens, France

Abstract

It is shown that disjunction of two switch-lists can blow up the representation size exponentially. Since switch-lists can be negated without any increase in size, this shows that conjunction of switch-lists also leads to an exponential blow-up in general.

Publisher

IOS Press

Subject

General Medicine

Reference7 articles.

1. Recognition of tractable DNFs representable by a constant number of intervals;Čepek;Discret. Optim.,2017

2. Properties of switch-list representations of Boolean functions;Chromý;J. Artif. Intell. Res.,2020

3. A knowledge compilation map;Darwiche;J. Artif. Intell. Res.,2002

4. Disjunctive closures for knowledge compilation;Fargier;Artif. Intell.,2014

5. H. Fargier, P. Marquis and A. Niveau, Towards a knowledge compilation map for heterogeneous representation languages, in: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3–9, 2013, F. Rossi, ed., IJCAI/AAAI, 2013, pp. 877–883, https://www.ijcai.org/Proceedings/13/Papers/135.pdf.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A faster implementation of EQ and SE queries for switch-list representations;Annals of Mathematics and Artificial Intelligence;2023-12-16