Results 1  10
of
307
Functional Reading of Logic Programs
"... We propose an embedding of logic programming into lazy functional programming in which each predicate in a Prolog program becomes a Haskell function, in such a way that both the declarative and the procedural reading of the Prolog predicate are preserved. The embedding computes by means of operation ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of operations on lazy lists. The state of each step in computation is passed on as a stream of answer substitutions, and all the logic operators of Prolog are implemented by explicit Haskell operators on these streams. The search strategy can be changed by altering the basic types of the embedding
Operational/Interpretive Unfolding of Multiadjoint Logic Programs
"... Abstract: Multiadjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systemat ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
returning a value which represents the fuzzy component (truth degree) of the computed answer. On the other hand, unfolding is a well known transformation rule widely used in declarative programming for optimizing and specializing programs, among other applications. In essence, it is usually based
Operational/Interpretive Unfolding of Multiadjoint Logic Programs
"... Abstract: Multiadjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systema ..."
Abstract
 Add to MetaCart
returning a value which represents the fuzzy component (truth degree) of the computed answer. On the other hand, unfolding is a well known transformation rule widely used in declarative programming for optimizing and specializing programs, among other applications. In essence, it is usually based
Computing Answer Sets of a Logic Program
"... Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program's completion [4]. The converse is true when the logic program is "tight& ..."
Abstract
 Add to MetaCart
rules, and it can compute only one answer set. Answer set solver CMODELS1 [12] is a system that computes answer sets for logic programs that are tight or can be transformed into tight programs, and does not suffer from these limitations.
A Transformation System for Lazy Functional Logic Programs
, 1999
"... Needed narrowing is a complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correctness results ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
Needed narrowing is a complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correctness results
Rules + Strategies for Transforming Lazy Functional Logic Programs
 Theoretical Computer Science
, 2004
"... This work introduces a transformation methodology for functional logic programs based on needed narrowing, the optimal and complete operational principle for modern declarative languages which integrate the best features of functional and logic programming. We provide correctness results for the tra ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
This work introduces a transformation methodology for functional logic programs based on needed narrowing, the optimal and complete operational principle for modern declarative languages which integrate the best features of functional and logic programming. We provide correctness results
Transformationbased Strategies for Lazy Functional Logic Programs
, 1999
"... Needed narrowing is an optimal and complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correct ..."
Abstract
 Add to MetaCart
Needed narrowing is an optimal and complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong
SSemantics Approach: Theory and Applications
, 1994
"... The paper is a general overview of an approach to the semantics of logic programs whose aim is finding notions of models which really capture the operational semantics, and are therefore useful for defining program equivalences and for semanticsbased program analysis. The approach leads to the intr ..."
Abstract

Cited by 124 (27 self)
 Add to MetaCart
The paper is a general overview of an approach to the semantics of logic programs whose aim is finding notions of models which really capture the operational semantics, and are therefore useful for defining program equivalences and for semanticsbased program analysis. The approach leads
Logic Programs as Term Rewriting Systems
, 1994
"... This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a onetoone correspondence between computed ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic program terminates iff the corresponding TRS terminates. This transform is refined in such a way that the above results hold for a relevant class
From Queries to Answers in Visual Logic Programming
 PROCEEDINGS OF VL'97, SEPTEMBER 2326, 1997 IN CAPRI, ITALY
, 1997
"... In VL'96 we presented a visual declarative programming language based on two main graphical constructs: directed acyclic graphs representing predicate application and graphical set inclusion representing logical implication. We showed that with these simple visual constructs we can cover most o ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
, and by defining visual inferences which operate on those diagrams. The result is an operational semantics for declarative programming which is intended to be visual, intuitive and formal. Visual because the inference rules display graphically the transformation of query diagrams into answer diagrams. Intuitive
Results 1  10
of
307