✦ LIBER ✦

On the complexity of the instance checking problem in concept languages with existential quantification

✍ Scribed by Andrea Schaerf

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 935 KB
Volume: 2
Category: Article
ISSN: 0925-9902
DOI: 10.1007/bf00962071

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of existential quantifica

The complexity of existential quantification in concept languages

✍ Francesco M. Donini; Maurizio Lenzerini; Daniele Nardi; Bernhard Hollunder; Wern 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 965 KB

Much of the research on concept languages, which also are called terminological languages, has focused on the computational complexity of subsumption. The intractability results can be divided into two groups. First, it has been shown that extending the basic language ,~Sfwith constructs containing

On the singularities of the solution to

On the singularities of the solution to the Cauchy problem with singular data in the complex domain

✍ Takao Kobayashi 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 911 KB

On the nature of electron donor-acceptor

On the nature of electron donor-acceptor interactions: 2. Mulliken's charge-transfer theory and the problem of the increase in intensity of the infrared band associated with iodine-base complexes

✍ Henryk Ratajczak; W.J. Orville-Thomas 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 544 KB

Handle with care! Complex scoring system

Handle with care! Complex scoring systems in measuring health-related quality of life. Commentary on Wilson et al. “The SF-36 summary scales: problems and solutions”

✍ Thomas Kohlmann 📂 Article 📅 2000 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 787 KB