Sciweavers

443 search results - page 68 / 89
» SAT-Based Answer Set Programming
Sort
View
WECWIS
2006
IEEE
103views ECommerce» more  WECWIS 2006»
14 years 1 months ago
Toward Semantic Composition of Web Services with MOVE
This paper describes a software solution for the WSChallenge 2006. We introduce the MOVE framework that has been applied to this challenge. Also, the architecture, algorithms, and...
Jürgen Dorn, Albert Rainer, Peter Hrastnik
ASP
2005
Springer
14 years 1 months ago
Modeling Hybrid Domains Using Process Description Language
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain value...
Sandeep Chintabathina, Michael Gelfond, Richard Wa...
ICALP
2003
Springer
14 years 1 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
KBSE
2002
IEEE
14 years 24 days ago
Generating Product-Lines of Product-Families
GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are ref...
Don S. Batory, Roberto E. Lopez-Herrejon, Jean-Phi...
ICLP
2009
Springer
14 years 8 months ago
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based charac...
Martin Gebser, Roland Kaminski, Benjamin Kaufmann,...