Sciweavers

754 search results - page 31 / 151
» An Ordered Logic Program Solver
Sort
View
92
Voted
CP
2005
Springer
15 years 6 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
106
Voted
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 5 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
103
Voted
ILP
2000
Springer
15 years 4 months 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...
115
Voted
LPNMR
2007
Springer
15 years 6 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
127
Voted
CP
2005
Springer
15 years 6 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen