1144 search results - page 135 / 229 » Logic programming for combinatorial problems |
176
Voted
IJCAI
1993
15 years 7 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
140
Voted
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
166
Voted
ATMOS
2007
15 years 7 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
157
Voted
KBSE
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
190
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...