The boundary between decidable and undecidable fragments of the fluent calculus

Authors:
Steffen Hölldobler;Dietrich Kuske
Affiliations:
Institut für Künstliche Intelligenz, TU Dresden, Dresden, Germany;Institut für Algebra, TU Dresden, Dresden, Germany
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 12
Cited 2

A logic-based calculus of events

New Generation Computing
A deductive solution for plan generation

New Generation Computing
Linear logic

Theoretical Computer Science
A new deductive approach to planning

New Generation Computing
An overview of transaction logic

Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Features and fluents (vol. 1): the representation of knowledge about dynamical systems

Features and fluents (vol. 1): the representation of knowledge about dynamical systems
Solving the frame problem: a mathematical investigation of the common sense law of inertia

Solving the frame problem: a mathematical investigation of the common sense law of inertia
Let's plan it deductively!

Artificial Intelligence - Special issue: artificial intelligence 40 years later
On Deductive Planning and the Frame Problem

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Nondeterministic Actions in the Fluent Calculus: Disjunctive State Update Axioms

Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Generating Plans in Linear Logic

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Automata theory for reasoning about actions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

A Theorem Prover with Dependent Types for Reasoning about Actions

Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
WSSL: a fluent calculus-based language for web service specifications

CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider entailment problems in the fluent calculus as they arise in reasoning about actions. Taking into account various fragments of the fluent calculus we formally show decidability results, establish their complexity, and prove undecidability results. Thus we draw a boundary between decidable and undecidable fragments of the fluent calculus.