We present an approach for solving some of the problems of top-down Inductive Logic Programming systems when learning multiple predicates. The approach is based on an algorithm for learning abduc-tive logic programs. Abduction is used to generate additional information that is useful for solving the problem of global inconsistency when learning multiple predicates.

We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...

Working within a semantic framework for sequent calculi developed in [3], we propose a couple of extensions to the concepts of correct answers and correct resultants which can be applied to the full first order logic. With respect to previous proposals, this is based on proof theory rather than model theory. We motivate our choice with several examples and we show how to use correct answers to ...

We present a forward sequent calculus for intuitionistic propositional linear logic (⊗, 1, N, >, b, ⊕, 0, !) and a corresponding inverse-method search strategy. Our approach centres around resource management, inspired by similar approaches for backward-directed calculi such as top-down linear logic programming. Surprisingly, the resource management problems for the forward direction turn out t...

Tabled evaluation ensures termination for programs with nite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the rst one encountered will use program clause resolution; the rest will resolve with the answers generated by the rst subgoal. This use of answer resolution prevents innnite looping which sometimes happens in SLD. Becaus...

Review of Olkowski, D. (2021). Deleuze, Bergson, Merleau-Ponty: The Logic and Pragmatics Creation, Affective Life, Perception. Indiana: Indiana UP.

Many top-down Inductive Logic Programming systems use a greedy, covering approach to construct hypotheses. This paper presents an alternative, cautious approach, known as cautious induction. We conjecture that cautious induction can allow better hypotheses to be found, with respect to some hypothesis quality criteria. This conjecture is supported by the presentation of an algorithm called CILS,...

We investigate a novel intuitionistic modal logic, called Propositional Lax Logic, with promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. The resulting logic is unorthodox in several respects. As a modal logic it is...