616 search results - page 92 / 124 » Bounded Model Checking with Description Logic Reasoning |
ICLP
1987
Springer
14 years 6 days ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
ARTS
1999
Springer
14 years 1 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
EMSOFT
2006
Springer
14 years 12 days ago
2006
Springer
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
ICLP
1999
Springer
14 years 1 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...