4940 search results - page 323 / 988 » On the Complexity of Universal Programs |
134
click to vote
AEI
1999
15 years 6 months ago
1999
The implantation of programs which gives a robot the ability to perform a non-repetitive task (task not completely de
176
click to vote
KR
2004
Springer
16 years 23 hour ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
213
click to vote
INFORMS
1998
15 years 6 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
168
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
165
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...