Sciweavers

654 search results - page 12 / 131
» Ordered Sets and Complete Lattices
Sort
View
FSS
2006
85views more  FSS 2006»
13 years 7 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
IEEEICCI
2009
IEEE
14 years 2 months ago
Interval sets and interval-set algebras
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
Yiyu Yao
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
14 years 23 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
ECCV
2008
Springer
14 years 9 months ago
Deformed Lattice Discovery Via Efficient Mean-Shift Belief Propagation
We introduce a novel framework for automatic detection of repeated patterns in real images. The novelty of our work is to formulate the extraction of an underlying deformed lattice...
Minwoo Park, Robert T. Collins, Yanxi Liu
AGP
2003
IEEE
14 years 25 days ago
An Ordered Choice Logic Programming Front-End for Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...
Marina De Vos