This paper presents complexity results about the satisfiability of modal Horn clauses for
several modal propositional logics. Almost all these results are negative in the sense that …

This paper is concerned with the computational complexity of the following problems for
various modal logics L: (1). The L-deducibility problem: given a finite set of formulas S and a …

CC is a bialgebra with antipode. If H is a Hopf algebra and M a left-comodule, MOM is
naturally defined as a left HIH-comodule. By pushing forward along the multiplication ZH, MBM …

Abstract interpretation is a technique extensively used for global dataflow analyses of logic
programs. Existing implementations of abstract interpretation are slow due to interpretive or …

This paper addresses the problems of movement transformation in Prolog-based bottom-up
parsing system. Three principles of Government-Binding theory are employed to deal with …

We present a method to improve the precision of mode analysis of logic programs. The idea
is to refine the approximation of non-variable terms into a lattice of recur-sive modes so the …

We present an efficient framework of type inference for logic programs by gener-alizing the
idea of type synihesis for Ground Prolog. Given a program and its top-level goals to be …

In this paper, we will propose a logic programming approach to design a frame-based
language. The relationship among frame, logic and Prolog is our basic design issue. Frame is …

Interaction with virtual objects among different devices attracts lots of attention recently. LuminAR
[Linder and Maes] was developed for a portable and compact projector-camera system …

The movement of constituents in natural language is a very common linguistic phenomenon—
topicalization and relativization in Mandarin Chinese, for example. Any successful natural …