3319 search results - page 120 / 664 » Subshifts, Languages and Logic |
187
click to vote
TKDE
2010
15 years 1 months ago
2010
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
208
click to vote
LCC
1994
15 years 10 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
150
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a separation logic framework which can express properties of memory separation between different points in a program. We describe an algorithm based on this fr...
153
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
144
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial poi...