93 search results - page 10 / 19 » From Disjunctive Programs to Abduction |
105
click to vote
LPNMR
1999
Springer
15 years 6 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
123
click to vote
IPCO
2008
15 years 3 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
125
Voted
PADL
2000
Springer
15 years 5 months ago
2000
Springer
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as...
134
Voted
WLP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
121
Voted
VL
2000
IEEE
15 years 6 months ago
2000
IEEE
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This paper studies the ways that untrained users naturall...