A sound and complete proof theory for the generalized logic of only knowing

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.10, Iss.4, 1998-10, pp. : 421-438

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

On proof normalization in linear logic

By Perrier G.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 353-354

Elsevier

Access to resources Recommend Favorite

A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics

By Yamasaki S. Kurose Y.

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 489-512

Elsevier

Access to resources Recommend Favorite

Specification and proof in membership equational logic

By Bouhoula A. Jouannaud J.-P. Meseguer J.

Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. : 35-132

Elsevier

Access to resources Recommend Favorite

Infiniteness of proof( ) is polynomial-space complete

By Hirokawa S.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 331-339

Elsevier

Access to resources Recommend Favorite

Boolean fuzzy logic and generalized capacities

By Biacino L. Gerla G.

International Journal of General Systems, Vol. 32, Iss. 4, 2003-07 ,pp. : 321-342

Taylor & Francis Ltd

Access to resources Recommend Favorite