Sciweavers

1722 search results - page 341 / 345
» Ontology Formalism Transformation
Sort
View
ECSQARU
2009
Springer
15 years 2 months ago
A Simple Modal Logic for Reasoning about Revealed Beliefs
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
Mohua Banerjee, Didier Dubois
POPL
1998
ACM
15 years 2 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
KDD
1997
ACM
169views Data Mining» more  KDD 1997»
15 years 2 months ago
Learning to Extract Text-Based Information from the World Wide Web
Thereis a wealthof informationto be minedfromnarrative text on the WorldWideWeb.Unfortunately, standard natural language processing (NLP)extraction techniques expect full, grammat...
Stephen Soderland
APN
1993
Springer
15 years 2 months ago
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitiv...
Søren Christensen, Niels Damgaard Hansen
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 2 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani