Sciweavers

86 search results - page 12 / 18
» Entailment of Finite Domain Constraints
Sort
View
SYNTHESE
2008
85views more  SYNTHESE 2008»
13 years 7 months ago
Objective Bayesianism with predicate languages
Objective Bayesian probability is often defined over rather simple domains, e.g., finite event spaces or propositional languages. This paper investigates the extension of objectiv...
Jon Williamson
ACL
2009
13 years 5 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
CSCLP
2008
Springer
13 years 9 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
CVPR
2004
IEEE
14 years 9 months ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi