Sciweavers

616 search results - page 106 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
SIAMCOMP
2012
11 years 10 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
ATAL
2006
Springer
13 years 11 months ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...
BPM
2008
Springer
217views Business» more  BPM 2008»
13 years 9 months ago
Detecting Regulatory Compliance for Business Process Models through Semantic Annotations
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
Guido Governatori, Jörg Hoffmann, Shazia Wasi...
ICRA
1993
IEEE
104views Robotics» more  ICRA 1993»
13 years 11 months ago
Numerical Determination of Optimal Non-Holonomic Paths in the Presence of Obstacles
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
Sudhaker Samuel, S. Sathiya Keerthi
POPL
2010
ACM
14 years 4 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi