662 search results - page 22 / 133 » Logic Programming with Ordered Disjunction |
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICLP
1994
Springer
13 years 11 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
MICAI
2000
Springer
13 years 11 months ago
2000
Springer
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
ILP
2007
Springer
14 years 1 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 ...
PADL
2005
Springer
14 years 1 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...