Sciweavers

754 search results - page 106 / 151
» An Ordered Logic Program Solver
Sort
View
126
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 9 days ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
LPNMR
2009
Springer
15 years 5 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
94
Voted
ITICSE
2003
ACM
15 years 5 months ago
Studying program correctness by constructing contracts
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D...
135
Voted
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 5 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
113
Voted
JFP
2000
163views more  JFP 2000»
15 years 13 days ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini