182 search results - page 1 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
AAAI
2012
11 years 7 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
JAIR
2012
11 years 7 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...