Sciweavers

1020 search results - page 79 / 204
» Tight Semantics for Logic Programs
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 3 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
CIA
2003
Springer
14 years 2 months ago
Logic Programming for Evolving Agents
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe Evolving Logic Progra...
José Júlio Alferes, Antonio Brogi, J...
ICLP
2005
Springer
14 years 2 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
ICLP
2009
Springer
14 years 9 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
PPDP
2009
Springer
14 years 3 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus