The Complexity of the Language A

@article{Liberatore1997TheCO,
  title={The Complexity of the Language A},
  author={Paolo Liberatore},
  journal={Electron. Trans. Artif. Intell.},
  year={1997},
  volume={1},
  pages={13-38}
}
In this paper we analyze the complexity of the language A pro posed in to formalize properties of actions We prove that the general language is NP complete thus intractable and show some tractable polynomial subclasses of it We also show how states that are unreachable a ect the semantics of the language 
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…