Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency
Aus International Center for Computational Logic
Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency
Ozan KahramanoğullarıOzan Kahramanoğulları
Ozan Kahramanoğulları
Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency
Technical Report, Knowledge Representation and Reasoning Group, Institute for Artificial Intelligence, Department of Computer Science, Dresden University of Technology, Dresden, Germany, volume WV--04--06, 2004
Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency
Technical Report, Knowledge Representation and Reasoning Group, Institute for Artificial Intelligence, Department of Computer Science, Dresden University of Technology, Dresden, Germany, volume WV--04--06, 2004
- Forschungsgruppe:Research Group: WissensverarbeitungKnowledge Representation and Reasoning
@techreport{K2004,
author = {Ozan Kahramano{\u{g}}ullar{\i}},
title = {Plans as Formulae with a Non-commutative Logical Operator -
Planning as Concurrency},
institution = {Knowledge Representation and Reasoning Group, Institute for
Artificial Intelligence, Department of Computer Science,
Dresden University of Technology, Dresden, Germany},
year = {2004}
}