Consistency checking reduced to satisfiability of concepts in terminological systems

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.18, Iss.2-4, 1997-01, pp. : 133-157

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

Checking the Satisfiability of Formulas Represented in Disjunctive Normal Form in the Language L. I

By Kryvyj S. Chebotarev A.

Cybernetics and Systems Analysis, Vol. 41, Iss. 4, 2005-07 ,pp. : 494-499

Springer Publishing Company

Access to resources Recommend Favorite

Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II

By Kryvyj S. Chebotarev A.

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 800-807

Springer Publishing Company

Access to resources Recommend Favorite

Model checking LTL with regular valuations for pushdown systems

By Esparza J. Kucera A. Schwoon S.

Information and Computation, Vol. 186, Iss. 2, 2003-11 ,pp. : 355-376

Elsevier

Access to resources Recommend Favorite

Differentiability of Consistency Functions for DAE Systems

By Büskens C. Gerdts M.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 1, 2005-04 ,pp. : 37-61

Springer Publishing Company

Access to resources Recommend Favorite

Testing satisfiability

By Alon N. Shapira A.

Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. : 87-103

Elsevier

Access to resources Recommend Favorite