5506 search results - page 615 / 1102 » Minimal Logic Programs |
275
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...
232
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...
208
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...
182
click to vote
IFSA
2007
Springer
16 years 1 months ago
2007
Springer
Disruption on a supply chain provokes lost that should be minimized looking for alternative suppliers. This solution involves a strategy to manage the impact of the disruption and ...
185
Voted
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...