In first-order logic, forward search using a complete strategy such as the inverse method can get stuck deriving larger and larger consequence sets when the goal query is unprovable. This is the case even in trivial theories where backward search strategies such as tableaux methods will fail finitely. We propose a general mechanism for bounding the consequence sets by means of finite approximat...

We present a simple entity-relationship-oriented model, which essentially includes the notion of class, together with different types of relations among classes, such as is-a, part-of, and disjointness. We define the semantics of the model in terms of first order logic, and present a sound, complete, and efficient inference algorithm for such a model. We argue that our model and the associated ...

search will most likely reveal numerous curious and provocative associations between health experiences in early childhood and the occurrence of later disease. Reduced exposure to infection in childhood has been implicated as a factor in the pathogenesis of insulin dependent diabetes (IDDM). Caspar Gibbon et al put this theory to the test in a brief but important paper on pages 384–5, which poi...

Non-determined game logic is the logic of two player board games where the game may end in a draw: unlike the case with determined games, a loss of one player does not necessarily constitute of a win of the other player. A calculus for non-determined game logic is given in [4] and shown to be complete. The calculus adds a new rule for the treatment of greatest fixpoints, and a new unfolding axi...