Sciweavers

1364 search results - page 168 / 273
» Comparative Branching-Time Semantics
Sort
View
131
Voted
NMR
2004
Springer
15 years 9 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
155
Voted
SPATIALCOGNITION
2004
Springer
15 years 9 months ago
Modelling Models of Robot Navigation Using Formal Spatial Ontology
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...
John A. Bateman, Scott Farrar
113
Voted
ICANN
2003
Springer
15 years 9 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...
ISSS
2002
IEEE
120views Hardware» more  ISSS 2002»
15 years 8 months ago
Virtual Synchronization for Fast Distributed Cosimulation of Dataflow Task Graphs
Fast distributed cosimulation is a challenging problem for the embedded system design. The main theme of this paper is to increase simulation speed by reducing the frequency of in...
Soonhoi Ha, Sungchan Kim, Chan-Eun Rhee, Hyunguk J...
153
Voted
MSR
2009
ACM
15 years 8 months ago
Automatic labeling of software components and their evolution using log-likelihood ratio of word frequencies in source code
As more and more open-source software components become available on the internet we need automatic ways to label and compare them. For example, a developer who searches for reusa...
Adrian Kuhn