Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.52, Iss.1, 2014-01, pp. : 31-65

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

Abstract

Related content

Exhausting strategies, joker games and full completeness for IMLL with Unit

By Murawski A.S. Ong C.-H.L.

Theoretical Computer Science, Vol. 294, Iss. 1, 2003-02 ,pp. : 269-305

Elsevier

Access to resources Recommend Favorite

Maximize Parallelism Minimize Overhead for Nested Loops via Loop Striping

By Xue Chun

Journal of VLSI Signal Processing, Vol. 47, Iss. 2, 2007-05 ,pp. : 153-167

Springer Publishing Company

Access to resources Recommend Favorite

Generalising the Konig-Egerváry theorem

By Andrew Alex

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 42, Iss. 4, 2013-04 ,pp. : 628-640

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Solving Discriminant Form Equations Via Unit Equations

By Smart N.

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 367-374

Academic Press

Access to resources Recommend Favorite

Indirect adaptive control of a two-wheeled vehicle with low-resolution input and output

By Konaka Eiji Suzuki Tatsuya Okuma Shigeru

Advanced Robotics, Vol. 19, Iss. 4, 2005-04 ,pp. : 349-371

Taylor & Francis Ltd

Access to resources Recommend Favorite