2084 search results - page 134 / 417 » Set Constraints in Logic Programming |
ICLP
1999
Springer
14 years 15 days ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
MLG
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
AMAI
2004
Springer
13 years 8 months ago
2004
Springer
Prototyping is a valuable technique to help software engineers explore the design space while gaining insight on the dynamics of the system. In this paper, we describe a method for...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...