Sciweavers

3134 search results - page 361 / 627
» Computing full disjunctions
Sort
View
KR
2000
Springer
15 years 4 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil
113
Voted
ECML
1991
Springer
15 years 4 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
112
Voted
ACNS
2010
Springer
161views Cryptology» more  ACNS 2010»
15 years 4 months ago
Multi-trail Statistical Saturation Attacks
Abstract. Statistical Saturation Attacks have been introduced and applied to the block cipher PRESENT at CT-RSA 2009. In this paper, we consider their natural extensions. First, we...
Baudoin Collard, François-Xavier Standaert
108
Voted
FOSSACS
2010
Springer
15 years 4 months ago
Linearly-Used Continuations in the Enriched Effect Calculus
Abstract. The enriched effect calculus is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. In this paper, we present an ext...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
107
Voted
AAAI
2007
15 years 3 months ago
DL-Lite in the Light of First-Order Logic
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...