On compact representations of propositional circumscription

Author： Cadoli M. Donini F.M. Schaerf M. Silvestri R.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.182, Iss.1, 1997-08, pp. : 183-202

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

Generating compact representations of static scenes by means of 3D object hierarchies

By Sappa Angel Domingo

The Visual Computer, Vol. 23, Iss. 2, 2007-02 ,pp. : 143-154

Springer Publishing Company

Access to resources Recommend Favorite

Effective domain representations of H(X), the space of compact subsets

By Blanck J.

Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. : 19-48

Elsevier

Access to resources Recommend Favorite

Process algebra with propositional signals

By Baeten J.C.M. Bergstra J.A.

Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. : 381-405

Elsevier

Access to resources Recommend Favorite

Embedding prioritized circumscription in disjunctive logic programs

By Chen Jianhua

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 11, Iss. 4, 1999-10 ,pp. : 553-563

Taylor & Francis Ltd

Access to resources Recommend Favorite

Axiomatizing the Skew Boolean Propositional Calculus

By Veroff R. Spinks M.

Journal of Automated Reasoning, Vol. 37, Iss. 1-2, 2006-08 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite