5423 search results - page 745 / 1085 » Denial-of-service in automation systems |
183
click to vote
LPAR
2005
Springer
16 years 10 days ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
180
click to vote
LPAR
2005
Springer
16 years 10 days ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
160
click to vote
LPNMR
2005
Springer
16 years 10 days ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
171
click to vote
LPNMR
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
167
click to vote
WEBI
2005
Springer
16 years 10 days ago
2005
Springer
Automated methods for resource annotation are a clear necessity, as the success of the Semantic Web depends on the availability of Web resources with meta-data conforming to known...