Sciweavers

461 search results - page 70 / 93
» Component-Based Answer Set Programming
Sort
View
JUCS
2006
135views more  JUCS 2006»
13 years 10 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
LPNMR
2009
Springer
14 years 4 months ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
WECWIS
2006
IEEE
103views ECommerce» more  WECWIS 2006»
14 years 4 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 3 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 3 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