NP-completeness of small conflict set generation for congruence closure-Reference-Cited by-同舟云学术

NP-completeness of small conflict set generation for congruence closure

Published:2017-06-22 Issue:3 Volume:51 Page:533-544
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Fellner Andreas^ORCID,Fontaine Pascal,Paleo Bruno Woltzenlogel

Funder

Agence Nationale de la Recherche

AW Apart

Austrian Research Promotion Agency (FFG)

Austrian Science Fund

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/s10703-017-0283-x/fulltext.html

Reference10 articles.

1. Frontiers in artificial intelligence and applications chapter 26;C Barrett,2009

2. Boudou J, Fellner A, Paleo BW (2014) Skeptik: A proof compression system. In: Demri S, Kapur D, Weidenbach C (eds) International joint conference on automated reasoning (IJCAR). Lecture notes in computer science, vol 8562. Springer, Berlin, pp 374–380

3. Downey PJ, Sethi R, Tarjan RE (1980) Variations on the common subexpressions problem. J ACM 27(4):758–771

4. Fellner A, Fontaine P, Hofferek G, Paleo BW (2015) NP-completeness of small conflict set generation for congruence closure. In: Ganesh V, Jovanović D (eds) International workshop on satisfiability modulo theories (SMT)

5. Fontaine P (2004) Techniques for verification of concurrent systems with invariants. PhD thesis, Institut Montefiore, Université de Liege, Belgium

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

1. Small Proofs from Congruence Closure;Form Comp Aid Design;2022