Backbones for Equality

Codish, Michael; Fekete, Yoav; Metodi, Amit

doi:10.1007/978-3-319-03077-7_1

Cited by 3 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Beyond SAT [9,11,24,30,38] and SAT-based applications [5,22,23,48,[54][55][56], backbones play a role in a wide range of combinatorial problems and in CSPs in general [8, 10, 21, 28, 29, 32-34, 45, 46, 49-53]. Variants and generalizations have also been proposed.…”

Section: Related Workmentioning

confidence: 99%

“…Backbones have been studied in the contexts of various combinatorial problems [8, 10, 21, 28, 29, 32-34, 45, 46, 49-53]. In terms of CSPs, backbones have been studied for general finite-domain constraint satisfaction, as well as in the context of Boolean satisfiability (SAT) [9,11,24,30,38]-as focused on also in this work. The problem of determining the backbone of a given propositional formula is a notably hard problem and surpasses the complexity of deciding satisfiability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A preference-based approach to backbone computation with application to argumentation

Previti

Järvisalo

2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

The backbone of a constraint satisfaction problem consists of those variables that take the same value in all solutions. Algorithms for determining the backbone of propositional formulas, i.e., Boolean satisfiability (SAT) instances, find various real-world applications. From the knowledge representation and reasoning (KRR) perspective, one interesting connection is that of backbones and the socalled ideal semantics in abstract argumentation. In this paper, we propose a new backbone algorithm which makes use of a "SAT with preferences" solver, i.e., a SAT solver which is guaranteed to output a most preferred satisfying assignment w.r.t. a given preference over literals of the SAT instance at hand. We also show empirically that the proposed approach is specifically effective in computing the ideal semantics of argumentation frameworks, noticeably outperforming an other state-of-the-art backbone solver as well as the winning approach of the recent ICCMA 2017 argumentation solver competition in the ideal semantics track.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A preference-based approach to backbone computation with application to argumentation

Previti

Järvisalo

2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…A number of recent algorithms have been proposed for computing the backbone of Boolean formulas [44,39,70,104]. Recently, generalized backbones were studied in [20].…”

Section: Backbone Literalsmentioning

confidence: 99%

Minimal sets on propositional formulae. Problems and reductions

Marques-Silva

Janota

Mencía

2017

Artificial Intelligence

View full text Add to dashboard Cite

“…To the best of our knowledge, no algorithms in the generality as presented here have been previously proposed; in the context of SMT, backbones have to the best of our knowledge been studied only in very specific context, see e.g. [19].…”

Section: Introductionmentioning

confidence: 99%

On Computing Generalized Backbones

Previti

Ignatiev

Järvisalo

et al. 2017

2017 IEEE 29th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

The concept of backbone variables, i.e., variables that take the same value in all solutions-or, equivalently, never take a specific value-finds various important applications in the context of Boolean satisfiability (SAT), motivating the development of efficient algorithms for determining the set of backbone variables of a given propositional formula. Notably, this problem surpasses the complexity of merely deciding satisfiability. In this work we consider generalizations of the concept of backbones in SAT to non-binary (and potentially infinite) domain constraint satisfaction problems. Specifically, we propose a natural generalization of backbones to the context of satisfiability modulo theories (SMT), applicable to a range of different theories as well as CSPs in general, and provide two generic algorithms for determining the backbone in this general context. As two concrete instantiations, we focus on two central SMT theories, the theory of linear integer arithmetic (LIA) with infinite integer domains, and the theory of bit vectors (BV), and empirically evaluate the potential of the proposed algorithms on both LIA and BV instances.

show abstract

Backbones for Equality

Cited by 3 publications

References 13 publications

A preference-based approach to backbone computation with application to argumentation

A preference-based approach to backbone computation with application to argumentation

Minimal sets on propositional formulae. Problems and reductions

On Computing Generalized Backbones

Contact Info

Product

Resources

About