3693 search results - page 501 / 739 » Splitting a Logic Program |
207
click to vote
FSTTCS
2010
Springer
14 years 12 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...
168
Voted
LOGCOM
2010
14 years 9 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...
126
click to vote
TKDE
2010
14 years 9 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...
112
click to vote
CSL
2006
Springer
15 years 6 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...
142
Voted
FOIKS
2006
Springer
15 years 6 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...