Sciweavers

429 search results - page 8 / 86
» A SAT approach to query optimization in mediator systems
Sort
View
AIPS
2008
13 years 11 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
AAAI
2006
13 years 10 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
WWW
2008
ACM
14 years 9 months ago
Composing and optimizing data providing web services
In this paper, we propose a new approach to automatically compose data providing Web services. Our approach exploits existing mature works done in data integration systems. Specif...
Mahmoud Barhamgi, Djamal Benslimane, Aris M. Oukse...
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
14 years 1 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
CAV
2008
Springer
89views Hardware» more  CAV 2008»
13 years 10 months ago
Inferring Congruence Equations Using SAT
This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, wh...
Andy King, Harald Søndergaard