1144 search results - page 114 / 229 » Logic programming for combinatorial problems |
162
click to vote
POPL
2011
ACM
14 years 5 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
133
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
120
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
105
Voted
ENTCS
2008
15 years 2 months ago
2008
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
145
click to vote
CSCLP
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...