4573 search results - page 636 / 915 » Automated Reasoning |
127
click to vote
CSL
2009
Springer
15 years 8 months 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...
148
click to vote
LPNMR
2009
Springer
15 years 8 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 ...
130
click to vote
LPNMR
2009
Springer
15 years 8 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 ...
119
click to vote
RR
2009
Springer
15 years 8 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...
149
click to vote
NDJFL
2002
15 years 3 months ago
2002
Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for im...