25 search results - page 3 / 5 » A Comparison of Sceptical NAF-Free Logic Programming Approac... |
AIIA
2005
Springer
13 years 10 months ago
2005
Springer
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
PDP
2009
IEEE
14 years 2 days ago
2009
IEEE
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
ACTA
1998
13 years 5 months ago
1998
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
POPL
2011
ACM
12 years 8 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...