60 search results - page 3 / 12 » Answer Set Programming with Constraints Using Lazy Grounding |
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
WCFLP
2005
ACM
13 years 11 months ago
2005
ACM
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...
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...
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...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...