Visual concealment of important objects and information by hands or tools can make many tasks more difficult. To alleviate this problem, hands and tools can be made partially tran...
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...