Clausal Presentation of Theories in Deduction Modulo

ISSN： 1000-9000

Source： Journal of Computer Science and Technology, Vol.28, Iss.6, 2013-11, pp. : 1085-1096

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On the Complexity of Deduction Modulo Leaf Permutative Equations

By Boy de la Tour Thierry Echenim Mnacho

Journal of Automated Reasoning, Vol. 33, Iss. 3-4, 2004-10 ,pp. : 271-317

Springer Publishing Company

Access to resources Recommend Favorite

An Instantiation Scheme for Satisfiability Modulo Theories

By Echenim Mnacho

Journal of Automated Reasoning, Vol. 48, Iss. 3, 2012-03 ,pp. : 293-362

Springer Publishing Company

Access to resources Recommend Favorite

Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)

By Barrett Clark Moura Leonardo Stump Aaron

Journal of Automated Reasoning, Vol. 35, Iss. 4, 2005-11 ,pp. : 373-390

Springer Publishing Company

Access to resources Recommend Favorite

Clausal Discovery

By de Raedt L. Dehaspe L.

Machine Learning, Vol. 26, Iss. 2-3, 1997-02 ,pp. : 99-146

Springer Publishing Company

Access to resources Recommend Favorite

Reductions for non-clausal theorem proving

By Aguilera G. de Guzman I.P. Ojeda-Aciego M. Valverde A.

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 81-112

Elsevier

Access to resources Recommend Favorite