97 search results - page 4 / 20 » A Generalized Gelfond-Lifschitz Transformation for Logic Pro... |
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
DOCENG
2009
ACM
14 years 1 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...