Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
Friedman and Halpern have introduced the inference by plausibility structures, which provides semantics for various default logics. This is a generalization of known inferences, su...
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...