1144 search results - page 49 / 229 » Logic programming for combinatorial problems |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
ESWA
2006
13 years 7 months ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...