Sciweavers

935 search results - page 136 / 187
» A Framework for Obfuscated Interpretation
Sort
View
AMAST
2000
Springer
15 years 8 months ago
Distance Functions for Defaults in Reactive Systems
Default reasoning has become an important topic in software engineering. In particular, defaults can be used to revise speci cations, to enhance reusability of existing systems, an...
Sofia Guerra
ICLP
1999
Springer
15 years 8 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
IWAN
1999
Springer
15 years 8 months ago
Policy Specification for Programmable Networks
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
Morris Sloman, Emil Lupu
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 8 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
KR
1998
Springer
15 years 8 months ago
Modal Semantics for Knowledge Bases Dealing with Vague Concepts
The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of...
Brandon Bennett