Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm

Jian-min, Zhang; Li, Sikun; Shen, Shengyu

doi:10.1007/11941439_89

Cited by 23 publications

(25 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, note that the views core definition, like other UN-SAT core definitions in the literature (see, e.g., [19], [21]), is about local minimality, not a global one. Thus, an unsatisfiable views specification may have many different view cores (for example, specification S 1 from Fig.…”

Section: B Views Corementioning

confidence: 99%

See 1 more Smart Citation

Why is My Component and Connector Views Specification Unsatisfiable?

Maoz

Pomerantz

Ringert

et al. 2017

2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

Abstract-Component and connector (C&C) views specifications, with corresponding verification and synthesis techniques, have been recently suggested as a means for formal yet intuitive structural specification of component and connector models. One challenge for effective use of C&C views synthesis relates to the case where the specification is unsatisfiable.In this work we present an approach to deal with unsatisfiable C&C views specifications. First, we define a notion of a C&C views specification core, a locally minimal unsatisfiable subset of the views specification. Second, based on the core, we generate explicit, concrete, structured natural-language report, which explains the cause of unsatisfiability. Finally, we extend our work to support specifications with architecture styles, library components, and Boolean formulas beyond simple conjunctions.Our views core computation relies on a new translation to SAT, via Alloy, which is refined enough to allow the extraction of detailed explanations. We implemented our work and evaluated it using 12 synthetic and real-world C&C views specifications. The evaluation examines the cost of the core computation and its effectiveness in reducing the size of the specification.

show abstract

Section: B Views Corementioning

confidence: 99%

“…Some work study the problem of finding unsatisfiable cores of unsatisfiable constraints written as propositional satisfiability formulas [6], [21]. Given an unsatisfiable CNF formula, a minimal unsatisfiable sub-formula, a minimal core, is a subset of its clauses that is both unsatisfiable and minimal, i.e., any subset of it is satisfiable.…”

Section: Unsat Corementioning

confidence: 99%

Why is My Component and Connector Views Specification Unsatisfiable?

Maoz

Pomerantz

Ringert

et al. 2017

2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

show abstract

“…The Hitting Set Directed Acyclic Graph (HSDAG) (Reiter 1987) algorithm calculates subset minimal inconsistent theories (Definition 4.14, as in different ASP solvers (Shlyakhter et al 2003;Syrjänen 2006). Implementations of Definition 4.15 have been described in (Lynce and Silva 2004) and (Zhang et al 2006). In our experiment, we have an implementation of Definition 4.14 (Wittocx et al 2009), where we do however do not calculate the entire set of subset minimal theories.…”

Section: Subtask 7: Explanationmentioning

confidence: 99%

The KB Paradigm and Its Application to Interactive Configuration

Pieter

Dasseville

Janssens

et al. 2016

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of inference. As such, the paradigm applies a strict separation of concerns between information and problem solving.In this paper, we analyze the principles and feasibility of the knowledge base paradigm in the context of an important class of applications: interactive configuration problems. In interactive configuration problems, a configuration of interrelated objects under constraints is searched, where the system assists the user in reaching an intended configuration. It is widely recognized in industry that good software solutions for these problems are very difficult to develop. We investigate such problems from the perspective of the KB paradigm. We show that multiple functionalities in this domain can be achieved by applying different forms of logical inferences on a formal specification of the configuration domain. We report on a proof of concept of this approach in a real-life application with a banking company.

show abstract

“…In particular, and due to its importance in formal verification, the problem of finding small unsatisfiable cores in SATi.e., unsatisfiable subsets of unsatisfiable sets of clauses-has been addressed by many authors in the recent years [8,9,11,4,7,10].…”

Section: Motivations and Goalsmentioning

confidence: 99%

“…In the last few years, several algorithms for computing small [11], minimal [7,4] or minimum [8][9][10] unsatisfiable cores of propositional formulas have been proposed. For lack of space, we can not provide details here, and we refer to the extended version [3] of the paper for a detailed description.…”

Section: Techniques For Unsatisfiable-core Extraction In Satmentioning

confidence: 99%

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories

Cimatti¹,

Griggio

Sebastiani

Theory and Applications of Satisfiability Testing – SAT 2007

View full text Add to dashboard Cite

Abstract. Finding small unsatisfiable cores for SAT problems has recently received a lot of interest, mostly for its applications in formal verification. Surprisingly, the same problem in the context of SAT Modulo Theories (SMT) has instead received very little attention in the literature; in particular, we are not aware of any work aiming at producing small unsatisfiable cores in SMT. The purpose of this paper is to start filling the gap in this area, by proposing a novel approach for computing small unsat cores in SMT. The main idea is to combine an SMT solver with an external propositional core extractor: the SMT solver produces the theory lemmas found during the search; the core extractor is then called on the boolean abstraction of the original SMT problem and of the theory lemmas. This results in an unsatisfiable core for the original SMT problem, once the remaining theory lemmas have been removed. The approach has several advantages: it is extremely simple to implement and to update, and it can be interfaced with every propositional core extractor in a plug-and-play way, so that to benefit for free of all unsatcore reduction techniques which have been or will be made available.

show abstract

Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm

Cited by 23 publications

References 11 publications

Why is My Component and Connector Views Specification Unsatisfiable?

Why is My Component and Connector Views Specification Unsatisfiable?

The KB Paradigm and Its Application to Interactive Configuration

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories

Contact Info

Product

Resources

About