The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
Yongmei Liu, Gerhard Lakemeyer, Hector J. Levesque
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
The advent of distributed memory parallel muchines turns feasible the design and implementation of dedicated environments for distributed applications. This puper addresses such a...
A growing interest is seen for designing intelligent environments that support personally meaningful, sociable and rich everyday experiences. In this paper we describe an intellige...
Dhaval Vyas, Marek R. van de Watering, Anton Eli&e...
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...