276 search results - page 33 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
101
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
103
click to vote
SIGSOFT
2005
ACM
16 years 2 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
TIME
1994
IEEE
15 years 5 months ago
1994
IEEE
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
167
click to vote
PTS
2010
14 years 11 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
103
click to vote
ICWL
2007
Springer
15 years 7 months ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...