641 search results - page 40 / 129 » Embedding Finite Sets in a Logic Programming Language |
133
Voted
ILP
2007
Springer
15 years 9 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
155
Voted
LOPSTR
2005
Springer
15 years 8 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
148
Voted
RULEML
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
109
Voted
TASE
2008
IEEE
15 years 9 months ago
2008
IEEE
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
138
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...