Sciweavers

308 search results - page 52 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
MP
2010
92views more  MP 2010»
13 years 2 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
ICSE
2010
IEEE-ACM
14 years 12 days ago
An analysis of the variability in forty preprocessor-based software product lines
Over 30 years ago, the preprocessor cpp was developed to extend the programming language C by lightweight metaprogramming capabilities. Despite its error-proneness and low ion lev...
Jörg Liebig, Sven Apel, Christian Lengauer, C...
NMR
2004
Springer
14 years 1 months ago
Frame consistency: computing with causal explanations
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
Andrea Bracciali, Antonis C. Kakas
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 7 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
14 years 1 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag