Metalevel Algorithms for Variant Satisfiability-Reference-Cited by-同舟云学术

Metalevel Algorithms for Variant Satisfiability

Published:2016 Issue: Volume: Page:167-184
ISSN:0302-9743
Container-title:Rewriting Logic and Its Applications
language:
Short-container-title:

Author:

Skeirik Stephen,Meseguer José

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-44802-2_10

Reference34 articles.

1. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Inf. Comput. 183(2), 140–164 (2003)

2. Lecture Notes in Computer Science;F Baader,2001

3. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, vol. 185, pp. 825–885. IOS Press, Amsterdam (2009). Chap. 26

4. Barrett, C., Shikanian, I., Tinelli, C.: An abstract decision procedure for satisfiability in the theory of inductive data types. J. Satisf. Boolean Model. Comput. 3, 21–46 (2007)

5. Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Clarke, E., Henzinger, T., Veith, H. (eds.) Handbook of Model Checking. Springer, Berlin (2014)

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

1. A Constructor-Based Reachability Logic for Rewrite Theories;Fundamenta Informaticae;2020-03-31

2. Metalevel algorithms for variant satisfiability;Journal of Logical and Algebraic Methods in Programming;2018-04

3. Variant-based satisfiability in initial algebras;Science of Computer Programming;2018-03

4. Variant-Based Decidable Satisfiability in Initial Algebras with Predicates;Logic-Based Program Synthesis and Transformation;2018

5. A Constructor-Based Reachability Logic for Rewrite Theories;Logic-Based Program Synthesis and Transformation;2018