Sciweavers

606 search results - page 53 / 122
» Constraint Hierarchies and Logic Programming
Sort
View
CPAIOR
2010
Springer
14 years 1 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
SUM
2007
Springer
14 years 3 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
POPL
2002
ACM
14 years 9 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
FOSSACS
2007
Springer
14 years 3 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ICLP
2003
Springer
14 years 2 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia