International Conference on Logic Programming 

About: International Conference on Logic Programming is an academic conference. The conference publishes majorly in the area(s): Logic programming & Answer set programming. Over the lifetime, 2507 publications have been published by the conference receiving 50783 citations.

Monodic fragments of first-order temporal logics: 2000-2001 A.D

Abstract: The aim of this paper is to summarize and analyze some results obtained in 2000-2001 about decidable and undecidable fragments of various first-order temporal logics, give some applications in the field of knowledge representation and reasoning, and attract the attention of the 'temporal community' to a number of interesting open problems.

Dafny: an automatic program verifier for functional correctness

Abstract: Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced verification tasks, such as extended static checking, have enjoyed the automation offered by satisfiability-modulo-theories (SMT) solvers. More recently, powerful SMT solvers and well-designed program verifiers are starting to break that tradition, thus reducing the effort involved in doing full verification. This paper gives a tour of the language and verifier Dafny, which has been used to verify the functional correctness of a number of challenging pointer-based programs. The paper describes the features incorporated in Dafny, illustrating their use by small examples and giving a taste of how they are coded for an SMT solver. As a larger case study, the paper shows the full functional specification of the Schorr-Waite algorithm in Dafny.

Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

Abstract: 1 INTRODUCTION This paper presents a way of extending the paradigm "proofs as programs" to classical proofs. The system we use is derived from the general Free Deduction system presented in [31. Usually when considering proofs as programs, one has only in mind some kind of intuitionistic proofs. There is an obvious reason for that restriction: only intuitionistic proofs are contructive, in the sense that from the proof of an existential statement, one can get a witness of this existential statement. But from the programming point of view, constructivity is only needed for E~-statements, for which classical and intuitionistic provability coincide. This means that, classical proofs are also candidates for being programs. In order to use them as programs, one has two tasks to achieve: (i) to find a system in which one can extract directly a program from a classical proof (and not by means of a translation to intuitionistic logic), and (ii) to understand the algorithmic meaning of classical constructions. The system we will consider is a natural deduction system with multiple conclusions, we will call it Classical Natural Deduction (the one with the absurdity rule being called Usual Natural Deduction). It is a particular subsystem of Free Deduction (FD) with inputs fixed to the left, chosen for its simplicity: it can be seen as a simple extension of intuitionistic natural deduction, whose algorithmic interpretation is very well known. In this context, the contribution of classical constructs to programming appears clearly: they correspond to control operators added to functional languages, like call/ce in Scheme. In both contexts, the role of the classical constructs is the same: they allow to take shorter routes in the construction of a proof~program. The link between control operators and classical constructs has first been made by T. Griffin in [1], where he proposes to type the C operator of Felleisen, with the type-~'-,A-* A. The system he obtains is not satisfactory from the logical point of view: the reduction is in fact a reduction strategy and the type assigned to C doesn't fit in general the reduction rule for C. C. Murthy further analysed the connections t91 between control operators, classical constructs and translations from classical logic to intuitionistic logic (see [4]). The difficulties met in trying to use-~-A ~ A (or the classical absurdity rule) as a type for control operators is not really due to classical logic, but much nore to …

Practical Reasoning for Expressive Description Logics

Abstract: Description Logics (DLs) axe a family of knowledge representation formetlisms mainly chauracterised by constructors to build complex concepts and iroles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ACC extended with transitive eind inverse roles, role hierarchies, and quaJifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ACC extended with just transitive and inverse roles is still in PSPACE. Finally, we investigate the limits of decidability for this family of DLs.

OLD resolution with tabulation

Abstract: To resolve the search-incompleteness of depth-first logic program interpreters, a new interpretation method based on the tabulation technique is developed and modeled as a refinement to SLD resolution. Its search space completeness is proved, and a complete search strategy consisting of iterated stages of depth-first search is presented. It is also proved that for programs defining finite relations only, the method under an arbitrary search strategy is terminating and complete.