The complexity of minimum partial truth assignments and implication in negation-free formulae

Author： delgrande J.P.   Gupta A.  

Publisher： Springer Publishing Company

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.18, Iss.1, 1997-01, pp. : 51-67

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

Free Boundaries in Partial Lubrication

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 42, Iss. 1, 1963-04 ,pp. : 126-138

John Wiley & Sons Inc

Access to resources Recommend Favorite

Free Boundaries in Partial Lubrication

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1963-04 ,pp. : 126-138

John Wiley & Sons Inc

Access to resources Recommend Favorite

The complexity space of partial functions: a connection between complexity analysis and denotational semantics

By Romaguera S.  

International Journal of Computer Mathematics, Vol. 88, Iss. 9, 2011-06 ,pp. : 1819-1829

Taylor & Francis Ltd

Access to resources Recommend Favorite

On minimum balanced bipartitions of triangle-free graphs

By Li Haiyan   Liang Yanting   Liu Muhuo   Xu Baogang  

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 557-566

Springer Publishing Company

Access to resources Recommend Favorite

On The Structure Of Triangle-Free Graphs Of Large Minimum Degree

By Łuczak* Tomasz  

Combinatorica, Vol. 26, Iss. 4, 2006-08 ,pp. : 489-493

Springer Publishing Company

Access to resources Recommend Favorite