Sciweavers

1435 search results - page 227 / 287
» E-connections of Description Logics
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 11 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
INTERNET
2002
175views more  INTERNET 2002»
14 years 11 months ago
Web Services Interaction Models, Part 1: Current Practice
of abstractions a middleware system makes available to applications, they figure prominently in determining the breadth and variety of application integration that the middleware s...
Steve Vinoski
DAC
2009
ACM
16 years 25 days ago
Event-driven gate-level simulation with GP-GPUs
Logic simulation is a critical component of the design tool flow in modern hardware development efforts. It is used widely ? from high-level descriptions down to gate-level ones ?...
Debapriya Chatterjee, Andrew DeOrio, Valeria Berta...
SEMWEB
2004
Springer
15 years 5 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer
SIGSOFT
2003
ACM
15 years 5 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee