146 search results - page 14 / 30 » Modelling and solving temporal reasoning as propositional sa... |
AAAI
1996
13 years 10 months ago
1996
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
DLOG
2008
13 years 11 months ago
2008
A recurring problem in conceptual modelling and ontology development is the representation of part-whole relations, with a requirement to be able to distinguish between essential a...
FMICS
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
AIPS
2009
13 years 9 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...