Sciweavers

1131 search results - page 40 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
CADE
2001
Springer
14 years 8 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
DALT
2006
Springer
14 years 3 days ago
A Functional Program for Agents, Actions, and Deontic Specifications
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
Adam Zachary Wyner
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
14 years 1 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
ILP
2000
Springer
14 years 18 hour ago
Learning First Order Logic Time Series Classifiers
A method for learning multivariate time series classifiers by inductive logic programming is presented. Two types of background predicate that are suited for this task are introduc...
Juan José Rodríguez, Carlos J. Alons...
ENTCS
2007
112views more  ENTCS 2007»
13 years 8 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo