616 search results - page 84 / 124 » Bounded Model Checking with Description Logic Reasoning |
CAV
2009
Springer
14 years 9 months ago
2009
Springer
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
KR
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
SEMWEB
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Recently, there have been a number of proposals for languages for expressing web service constraints and capabilities, with WSPolicy and WSPL leading the way. The propose...
ECBS
2008
IEEE
13 years 10 months ago
2008
IEEE
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
TCS
2002
13 years 8 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...