Sciweavers

4480 search results - page 62 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
171
Voted
JAIR
2012
254views Hardware» more  JAIR 2012»
13 years 5 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
171
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 7 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
CP
2009
Springer
16 years 4 months ago
Weakly Monotonic Propagators
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
Christian Schulte, Guido Tack
DATE
2002
IEEE
86views Hardware» more  DATE 2002»
15 years 8 months ago
A Layered, Codesign Virtual Machine Approach to Modeling Computer Systems
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
JoAnn M. Paul, Donald E. Thomas
148
Voted
JSA
2000
175views more  JSA 2000»
15 years 3 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd