3470 search results - page 344 / 694 » Head-Elementary-Set-Free Logic Programs |
224
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...
196
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
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
179
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
198
click to vote
ESOP
2007
Springer
16 years 25 days ago
2007
Springer
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...