Author:
Gershman Roman,Koifman Maya,Strichman Ofer
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Reference29 articles.
1. Amla N, McMillan K (2003) Automatic abstraction without counterexamples. In: Garavel H, Hatcliff J (eds) TACAS’03. Lecture notes in computer science, vol 2619
2. Audemard G, Bertoli P, Cimatti A, Kornilowicz A, Sebastiani R (2002) A SAT based approach for solving formulas over boolean and linear mathematical propositions. In: Proc 18th international conference on automated deduction (CADE’02)
3. Bruni R (2003) Approximating minimal unsatisfiable subformula by means of adaptive core search. Discrete Appl Math 130(2):85–100
4. Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5:394–397
5. Davydov G, Davydova I, Büning HK (1998) An efficient algorithm for the minimal unsatisfiability problem for a subclass of cnf. Ann Math Artif Intell 23(3–4):229–245
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficiently Explaining CSPs with Unsatisfiable Subset Optimization;Journal of Artificial Intelligence Research;2023-11-25
2. Accelerating Predicate Abstraction by Minimum Unsatisfiable Cores Extraction;Communications in Computer and Information Science;2021
3. Reducing Interpolant Circuit Size Through SAT-Based Weakening;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2020-07
4. Structural Aspects;Automated Validation & Verification of UML/OCL Models Using Satisfiability Solvers;2018
5. Re-utilizing Verification Results of UML/OCL Models;Automated Validation & Verification of UML/OCL Models Using Satisfiability Solvers;2018