Results 1  10
of
16,942
Programming in Pure Prolog
"... this domain. Then, in Section 5.5 we introduce a fundamental data structure of Prolog  that of lists and provide several classic programs that use them. In the subsequent section an example of a program is given which illustrates Prolog's use of terms to represent complex objects. Then in S ..."
Abstract
 Add to MetaCart
. Then in Section 5.7 we introduce another important data structure  that of binary trees and present various programs computing over them. We conclude 104 Introduction 105 the chapter by trying to assess in Section 5.8 the relevant aspects of programming in pure Prolog. We also summarize there the shortcomings
Analysis of pure PROLOG programs
 Proceedings GULPPRODE '95, 1995 Joint Conference on Declarative Programming
, 1995
"... We define a new fixpoint semantics for pure PROLOG, which is obtained as an instance of the generalized semantics of CLP and is oriented towards abstract interpretation. The concrete semantics is obtained by attaching to goals and constraints a history component that remembers the sequence of choice ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We define a new fixpoint semantics for pure PROLOG, which is obtained as an instance of the generalized semantics of CLP and is oriented towards abstract interpretation. The concrete semantics is obtained by attaching to goals and constraints a history component that remembers the sequence
Weakest Preconditions for Pure Prolog Programs
 Information Processing Letters
, 1998
"... We introduce a characterization of weakest preconditions and weakest liberal preconditions of pure Prolog programs P and postconditions Post in terms of ordinal closures of a natural operator based on P and Post . ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce a characterization of weakest preconditions and weakest liberal preconditions of pure Prolog programs P and postconditions Post in terms of ordinal closures of a natural operator based on P and Post .
Pure Prolog Execution in 21 Rules
"... Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for form ..."
Abstract
 Add to MetaCart
Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable
Pure Prolog Execution in 21 Rules
, 2003
"... Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for form ..."
Abstract
 Add to MetaCart
Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable
Pure Prolog Execution in 21 Rules
"... Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for form ..."
Abstract
 Add to MetaCart
Abstract. A simple mathematical definition of the 4port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable
Reasoning about Termination of Pure Prolog Programs
 Information and Computation
, 1993
"... We provide a theoretical basis for studying termination of (general) logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. We offer a characterization of ..."
Abstract

Cited by 129 (14 self)
 Add to MetaCart
We provide a theoretical basis for studying termination of (general) logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. We offer a characterization
Firstorder theories for pure Prolog programs with negation
 Archive for Mathematical Logic
, 1995
"... The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the #completion and the inductive extension of a logic program. Both are firsto ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the #completion and the inductive extension of a logic program. Both are first
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 47 (5 self)
 Add to MetaCart
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
Towards a Logical Semantics for Pure Prolog
, 1998
"... The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depthfirst lefttoright evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a fourvalued logic. The semantics is based on a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depthfirst lefttoright evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a fourvalued logic. The semantics is based
Results 1  10
of
16,942