1587 search results - page 205 / 318 » The Semantics of Extended SOFL |
GG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
LPNMR
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
AGP
2003
IEEE
14 years 2 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
SAC
2003
ACM
14 years 2 months ago
2003
ACM
Workflow technology plays a key role as an enabler in E-Commerce applications, such as supply chains. Until recently the major share of the attention of workflow systems researche...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...