Propositional default logics made easier: computational complexity of model checking

Author： Baumgartner R.   Gottlob G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 591-627

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

Belief Revision and Update: Complexity of Model Checking

By Liberatore P.   Schaerf M.  

Journal of Computer and System Sciences, Vol. 62, Iss. 1, 2001-02 ,pp. : 43-72

Academic Press

Access to resources Recommend Favorite

Scientific Theories of Computational Systems in Model Checking

By Angius Nicola  

Minds and Machines, Vol. 21, Iss. 2, 2011-05 ,pp. : 323-336

Springer Publishing Company

Access to resources Recommend Favorite

Studying properties of classes of default logics

By Antoniou Grigoris   O'Neill Tyrone   Thurbon Joe  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 10, Iss. 4, 1998-10 ,pp. : 495-505

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel propositional satisfiability checking with distributed dynamic learning

By Blochinger W.   Sinz C.   Kuchlin W.  

Parallel Computing, Vol. 29, Iss. 7, 2003-07 ,pp. : 969-994

Elsevier

Access to resources Recommend Favorite

Model Checking for Combined Logics with an Application to Mobile Systems: Special Issue on Distributed and Mobile Software Engineering (Guest Editors: Carlo Ghezzi and Paola Inverardi)

By Franceschet Massimo  

Automated Software Engineering, Vol. 11, Iss. 3, 2004-06 ,pp. : 289-321

Springer Publishing Company

Access to resources Recommend Favorite