Sciweavers

881 search results - page 23 / 177
» Solving satisfiability problems with preferences
Sort
View
GRID
2010
Springer
14 years 6 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger
BPM
2006
Springer
115views Business» more  BPM 2006»
15 years 1 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
ICFEM
2009
Springer
14 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
AAAI
2006
14 years 11 months ago
Contingent Planning with Goal Preferences
The importance of the problems of contingent planning with actions that have non-deterministic effects and of planning with goal preferences has been widely recognized, and severa...
Dmitry Shaparau, Marco Pistore, Paolo Traverso
TEC
2008
139views more  TEC 2008»
14 years 9 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane