Results 1  10
of
169
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
order rangerestricted definite clause. This paper summarises the syntax, distributional semantics and proof techniques for SLPs and then discusses how a standard Inductive Logic Programming (ILP) system, Progol, has been modied to support learning of SLPs. The resulting system 1) nds an SLP with uniform
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
Smodels  an Implementation of the Stable Model and WellFounded Semantics for Normal Logic Programs
, 1997
"... The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range ..."
Abstract

Cited by 294 (9 self)
 Add to MetaCart
The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a
An Implementation of Narrowing Strategies
 Journal of the ACM
, 2001
"... This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic progra ..."
Abstract

Cited by 302 (116 self)
 Add to MetaCart
) or techniques for search control (e.g., encapsulated search). Thanks to the use of an intermediate and portable representation of programs, our implementation is general enough to be used as a common back end for a wide variety of functional logic languages.
A semantics for weakly . . .
, 2013
"... Encapsulated search is a key feature of (functional) logic languages. It allows the programmer to access and process different results of a nondeterministic computation within a program. Unfortunately, due to advanced operational features (lazy evaluation, partial values, infinite structures), ther ..."
Abstract
 Add to MetaCart
functional logic language like Curry and provide a comprehensive definition that covers weak encapsulation, a modular form of encapsulation, as well as nested applications of search operators. We set up a denotational semantics that distinguishes nontermination and different levels of failures in a
Encapsulated Search and Constraint Programming in Oz
, 1994
"... Oz is an attempt to create a highlevel concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints and search). Its computation model can be seen as a rather radical extension of the concurrent constraint model providing for higherorder pro ..."
Abstract

Cited by 40 (17 self)
 Add to MetaCart
Oz is an attempt to create a highlevel concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints and search). Its computation model can be seen as a rather radical extension of the concurrent constraint model providing for higher
Declarative Debugging for Encapsulated Search Abstract
"... Declarative debugging has been proposed as a suitable technique for developing debuggers in the context of declarative languages. However, to become really useful debuggers must be able to deal with those parts of the languages that have no clear declarative semantics but are widely used in realisti ..."
Abstract
 Add to MetaCart
in realistic programs. We explain in this paper how a declarative debugger of wrong answers for the lazy functionallogic language Curry can be extended to debug programs including the encapsulated search, an important feature of this language designed to control nondeterministic computation steps. We show
Encapsulated Effects
, 1995
"... Side effects in imperative programming languages are ubiquitous, which makes it difficult to reason about programs in other than operational terms. Functional programming languages, on the other hand, claim the advantage that equational logics are sufficient for reasoning, but at the that often usef ..."
Abstract
 Add to MetaCart
useful effects, such as interactive input, exceptions, and explicit updates of state cannot be accommodated. This paper shows a way to bring these two worlds of programming style closer together, by neatly encapsulating the effectsproducing semantics features that one wishes to use to design useful
Demanddriven Search in Functional Logic Programs
, 1998
"... In this paper we discuss the advantage of lazy functional logic languages to solve search problems. We show that the lazy evaluation strategy of such languages can be easily exploited to implement a solver that explores only the dynamically demanded parts of the search space. In contrast to pure log ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
logic programming, the use of nondeterministic functions enables a modular and simple implementation without the risk of floundering. Furthermore, a local encapsulation of search is useful to avoid the combinatorial explosion of the demanded search space. The necessary features (laziness, non
Extensions of the WFS Semantics for Logic Programming
"... WFS and STABLE are the two most well known non monotonic semantics for logic programming. We introduce WFS ext1 and WFS ext2 , which are non monotonic semantics for function free normal programs. The suitable properties of these semantics are that they extend WFS by allowing a weak form of reasoning ..."
Abstract
 Add to MetaCart
WFS and STABLE are the two most well known non monotonic semantics for logic programming. We introduce WFS ext1 and WFS ext2 , which are non monotonic semantics for function free normal programs. The suitable properties of these semantics are that they extend WFS by allowing a weak form
Results 1  10
of
169