4573 search results - page 429 / 915 » Automated Reasoning |
176
click to vote
KR
1989
Springer
15 years 11 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
190
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
166
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
205
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
209
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...