5482 search results - page 650 / 1097 » Logic Programming and Databases |
200
click to vote
IPL
2008
15 years 6 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
273
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
229
click to vote
LOGCOM
2010
15 years 1 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
206
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...
282
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...