Results 1  10
of
130
Logic Programming and Negation: A Survey
 JOURNAL OF LOGIC PROGRAMMING
, 1994
"... We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them. ..."
Abstract

Cited by 280 (8 self)
 Add to MetaCart
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them.
A Semantic Basis for the Termination Analysis of Logic Programs
 Journal of Logic Programming
, 1999
"... This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings  a possibly infinite set of binary clauses. Termination of a program P and goal G is determined by the abs ..."
Abstract

Cited by 114 (14 self)
 Add to MetaCart
(Show Context)
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings  a possibly infinite set of binary clauses. Termination of a program P and goal G is determined by the absence of an infinite chain in the binary unfoldings of P starting with G. The result is of practical use as basing termination analysis on a formal semantics facilitates both the design and implementation of analyzers. A simple Prolog interpreter for binary unfoldings coupled with an abstract domain based on symbolic norm constraints is proposed as an implementation vehicle. We illustrate its application using two recently proposed abstract domains. Both techniques are implemented using a standard CLP(R) library. The combination of an interpreter for binary unfoldings and a constraint solver simplifies the design of the analyzer and improves its efficiency significantly. 1 Introduction This ...
Automatic Termination Analysis of Logic Programs
 Proceedings of the Fourteenth International Conference on Logic Programming
, 1997
"... This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms. It ca ..."
Abstract

Cited by 68 (3 self)
 Add to MetaCart
This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms. It can handle automatically most of the examples found in the literature on termination of logic programs, and about half of the programs in the benchmarks of [5]. The algorithm employed by the system consists of three main parts: instantiation analysis (i.e., rigidity analysis), constraint inference, and construction of the querymapping pairs associated with the program and query. Each of these parts generalizes earlier work related to termination analysis. 1 Introduction Termination analysis of logic programs has been the focus of intensive research in recent years. Systems for automatic termination analysis are proposed, for example, in [15, 20, 22]. Methodologies and techniques for proving ...
Logic Programs and Connectionist Networks
 Journal of Applied Logic
, 2004
"... One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networks and logic programs. In this paper, we show that certain semantic operators for propositional logic p ..."
Abstract

Cited by 63 (22 self)
 Add to MetaCart
(Show Context)
One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networks and logic programs. In this paper, we show that certain semantic operators for propositional logic programs can be computed by feedforward connectionist networks, and that the same semantic operators for firstorder normal logic programs can be approximated by feedforward connectionist networks. Turning the networks into recurrent ones allows one also to approximate the models associated with the semantic operators. Our methods depend on a wellknown theorem of Funahashi, and necessitate the study of when Funahasi's theorem can be applied, and also the study of what means of approximation are appropriate and significant.
Topology and the Semantics of Logic Programs
 Fundamenta Informaticae
, 1995
"... We introduce topologies on spaces of interpretations which extend and generalise the query and positive query topologies of Batarekh and Subrahmanian. We study continuity in these topologies of the immediate consequence map associated with any normal logic program and provide necessary and sufficien ..."
Abstract

Cited by 51 (31 self)
 Add to MetaCart
We introduce topologies on spaces of interpretations which extend and generalise the query and positive query topologies of Batarekh and Subrahmanian. We study continuity in these topologies of the immediate consequence map associated with any normal logic program and provide necessary and sufficient conditions for continuity to hold. We relate these ideas to (i) computational power of programs; (ii) canonical programs; (iii) the declarative semantics of definite programs; (iv) Maher's down continuous programs; (v) the decency thesis of Jaffar, Lassez and Maher, and (vi) compactness of sets of fixed points and models. 1 Introduction The classical approach to the study of fixed point semantics of definite logic programs P utilises two main facts: (1) The set I J L of all interpretations of the underlying language L based on a given preinterpretation J forms a complete lattice under the partial order of set inclusion. (2) The immediate consequence map T P defined on I J L is latti...
Modular Termination Proofs for Logic and Pure Prolog Programs
 ADVANCES IN LOGIC PROGRAMMING THEORY
, 1993
"... We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in ..."
Abstract

Cited by 48 (5 self)
 Add to MetaCart
(Show Context)
We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way.
Abstract Diagnosis
, 2001
"... We show how declarative diagnosis techniques can be extended to cope with verification properties, such as depth(k) answers and groundness dependencies. The extension is achieved by using a simple semantic framework, based on abstract interpretation. The resulting technique (abstract diagnosis) lead ..."
Abstract

Cited by 43 (15 self)
 Add to MetaCart
We show how declarative diagnosis techniques can be extended to cope with verification properties, such as depth(k) answers and groundness dependencies. The extension is achieved by using a simple semantic framework, based on abstract interpretation. The resulting technique (abstract diagnosis) leads to elegant bottomup and topdown verification methods, which do not require to determine the symptoms in advance, and which are effective in the case of abstract properties described by finite domains.
Mode and Termination Checking for HigherOrder Logic Programs
 In Hanne Riis Nielson, editor, Proceedings of the European Symposium on Programming
, 1996
"... . We consider how mode (such as input and output) and termination properties of typed higherorder constraint logic programming languages may be declared and checked effectively. The systems that we present have been validated through an implementation and numerous case studies. 1 Introduction Jus ..."
Abstract

Cited by 41 (11 self)
 Add to MetaCart
(Show Context)
. We consider how mode (such as input and output) and termination properties of typed higherorder constraint logic programming languages may be declared and checked effectively. The systems that we present have been validated through an implementation and numerous case studies. 1 Introduction Just like other paradigms logic programming benefits tremendously from types. Perhaps most importantly, types allow the early detection of errors when a program is checked against a type specification. With some notable exceptions most type systems proposed for logic programming languages to date (see [18]) are concerned with the declarative semantics of programs, for example, in terms of manysorted, ordersorted, or higherorder logic. Operational properties of logic programs which are vital for their correctness can thus neither be expressed nor checked and errors will remain undetected. In this paper we consider how the declaration and checking of mode (such as input and output) and termina...
On the role of semantic approximations in validation and diagnosis of constraint logic programs
 University
, 1997
"... work in the ESPRIT project DiSCiPl. The project aims at devising advanced tools for debugging of constraint logic programs. Acentral problem in program development is obtaining a program which satis es the user's expectations. When considering a given program, a natural question is then whether ..."
Abstract

Cited by 37 (21 self)
 Add to MetaCart
work in the ESPRIT project DiSCiPl. The project aims at devising advanced tools for debugging of constraint logic programs. Acentral problem in program development is obtaining a program which satis es the user's expectations. When considering a given program, a natural question is then whether or not it
Termination Analysis for Mercury
, 1997
"... Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, from a practical point of view, the significance of much of the work on termination is hard to judge, since experimental evaluations rarely get published. Here we describe and eval ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
(Show Context)
Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, from a practical point of view, the significance of much of the work on termination is hard to judge, since experimental evaluations rarely get published. Here we describe and evaluate a termination analyzer for Mercury, a strongly typed and moded logicfunctional programming language. Mercury's high degree of referential transparency and the guaranteed availability of reliable mode information simplify the termination analysis of Mercury compared with that of other logic programming languages. We describe our termination analyzer, which uses a variant of a method developed by Plumer. It deals with full Mercury, including modules, declarative input/output, the foreign language interface, and higherorder features. In spite of these obstacles, it produces highquality termination information, comparable to the results recently obtained by Lindenstrauss and Sagiv. Most i...