23 search results - page 3 / 5 » A propositional theorem prover to solve planning and other p... |
CLIMA
2004
13 years 7 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
AUSAI
2007
Springer
13 years 10 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
MKM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...
JAIR
2006
13 years 6 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
ICTAI
2002
IEEE
13 years 11 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...