Sciweavers

5128 search results - page 17 / 1026
» When Abstraction Fails
Sort
View
ICALP
2009
Springer
14 years 7 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
EGOV
2005
Springer
14 years 28 days ago
When Technology Meets the Mind: A Comparative Study of the Technology Acceptance Model
Abstract. Issues related to technology, including diffusion, acceptance, adoption, and adaptation, have been the focus of research for different disciplines including Information S...
Lucy Dadayan, Enrico Ferro
ESWS
2010
Springer
13 years 9 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter
SEMWEB
2010
Springer
13 years 5 months ago
When owl: sameAs Isn't the Same: An Analysis of Identity in Linked Data
Abstract. In Linked Data, the use of owl:sameAs is ubiquitous in interlinking data-sets. There is however, ongoing discussion about its use, and potential misuse, particularly with...
Harry Halpin, Patrick J. Hayes, James P. McCusker,...
SCP
1998
134views more  SCP 1998»
13 years 7 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne