Sciweavers

1791 search results - page 226 / 359
» Semantics and Complexity of SPARQL
Sort
View
ICANN
2003
Springer
15 years 10 months ago
Learning Rule Representations from Boolean Data
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
Bruno Apolloni, Andrea Brega, Dario Malchiodi, Gio...
AUSAI
2001
Springer
15 years 9 months ago
Actions Made Explicit in BDI
Abstract. The Belief, Desire, Intention (BDI) architecture is increasingly being used in a wide range of complex applications for agents. Many theories and models exist which suppo...
Vineet Padmanabhan, Guido Governatori, Abdul Satta...
ISSS
2000
IEEE
109views Hardware» more  ISSS 2000»
15 years 9 months ago
Verification of Embedded Systems using a Petri Net based Representation
The ever increasing complexity of embedded systems consisting of hardware and software components poses a challenge in verifying their correctness, New verification methods that o...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
APLAS
2000
ACM
15 years 9 months ago
A New Criterion for Safe Program Transformations
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
Yasuhiko Minamide
ADL
2000
Springer
284views Digital Library» more  ADL 2000»
15 years 9 months ago
A Boolean Query Processing with a Result Cache in Mediator Systems
A mediator system is a kind of a meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator ...
Jae-Heon Cheong, Sang-goo Lee