A new deductive approach to planning
New Generation Computing
A simple solution to the Yale shooting problem
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Artificial intelligence and mathematical theory of computation
SLDNF-resolution with equality
Journal of Automated Reasoning
Handbook of logic in artificial intelligence and logic programming
Artificial Intelligence - Special issue: artificial intelligence 40 years later
The Book of Traces
Complex Plans in the Fluent Calculus
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
CL '00 Proceedings of the First International Conference on Computational Logic
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
CL '00 Proceedings of the First International Conference on Computational Logic
| Hi-index | 0.00 |
A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a fluent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that the correctness of the Fluent Calculus as a solution to the Frame Problem still holds under the new foundation. Furthermore, we extend our theory by an induction axiom needed for reasoning about integer-valued resources.