Tractability through symmetries in propositional calculus-Reference-Cited by-同舟云学术

Tractability through symmetries in propositional calculus

Published:1994 Issue:1 Volume:12 Page:89-102
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Benhamou Belaid,Sais Lakhdar

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00881844.pdf

Reference15 articles.

1. Bauer, M., Brand, D., Fischer, M. J., Meyer, A. R., and Paterson, M. S., ?A note on disjunctive form tautologies?,SIGACT News 5, 17?20 (1973).

2. Benhamou, B. and Sais, L., ?Etude des symétries en calcul propositionnel?, Rapport de recherche Maiup No. 91-01, Université de Provence (1991).

3. Benhamou, B. and Sais, L., ?Etude des symétries en calcul propositionnel?, Mémoire de Dea GIA-Marseille-Luminy (France) (1990).

4. Cubbada, C. and Mouseigne, M. D., ?Variantes de l'algorithme de sl-resolution avec retenue d'information?, Thèse de 3ème cycle. GIA, Marseille, Luminy (France) (1988).

5. Davis and Putnam, ?A computing procedure for quantification theory?,JACM 7 201?215 (1960).

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

1. Symmetry and Dominance Breaking for Pseudo-Boolean Optimization;Communications in Computer and Information Science;2023

2. Detecting and exploiting symmetries in sequential pattern mining;International Journal of Data Mining, Modelling and Management;2022

3. Chapter 21. Combinatorial Designs by SAT Solvers1;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. Chapter 13. Symmetry and Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02

5. Resolution with Symmetry Rule Applied to Linear Equations;LEIBNIZ INT PR INFOR;2021