4617 search results - page 657 / 924 » Automation of Diagrammatic Reasoning |
173
click to vote
CSL
2009
Springer
16 years 14 hour ago
2009
Springer
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
214
click to vote
LPNMR
2009
Springer
15 years 12 months ago
2009
Springer
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
189
click to vote
LPNMR
2009
Springer
15 years 12 months ago
2009
Springer
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
168
click to vote
RR
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
225
click to vote
ISSS
1998
IEEE
15 years 11 months ago
1998
IEEE
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...