Sciweavers

1144 search results - page 26 / 229
» Logic programming for combinatorial problems
Sort
View
CP
2003
Springer
14 years 26 days ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
WILF
2005
Springer
91views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
Multi-lattices as a Basis for Generalized Fuzzy Logic Programming
A prospective study of the use of ordered multi-lattices as underlying sets of truth-values for a generalised framework of logic programming is presented. Specifically, we investi...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
14 years 26 days 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
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
CP
2003
Springer
14 years 26 days ago
Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabri...