Initial Steps Towards a Family of Regular-Like Plan Description Logics
- 1 June 2019
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 90-109
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Shuffled languages—Representation and recognitionTheoretical Computer Science, 2013
- Succinctness of the Complement and Intersection of Regular ExpressionsACM Transactions on Computational Logic, 2012
- The Complexity of Regular(-Like) ExpressionsLecture Notes in Computer Science, 2010
- Tight Bounds on the Descriptional Complexity of Regular ExpressionsLecture Notes in Computer Science, 2009
- Shuffle languages are in PTheoretical Computer Science, 2001
- A Temporal Description Logic for Reasoning about Actions and PlansJournal of Artificial Intelligence Research, 1998
- Taxonomic plan reasoningArtificial Intelligence, 1996
- A Formal Definition for the Expressive Power of Terminological Knowledge Representation LanguagesJournal of Logic and Computation, 1996
- CLASSIC: a structural data model for objectsACM SIGMOD Record, 1989
- The complexity of the inequivalence problem for regular expressions with intersectionLecture Notes in Computer Science, 1980