The Guarded Fragment of Conceptual Graphs

Aus International Center for Computational Logic
Version vom 19. März 2015, 18:44 Uhr von Marcel Lippmann (Diskussion | Beiträge)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche
Toggle side column

The Guarded Fragment of Conceptual Graphs

F. BaaderF. Baader,  R. MolitorR. Molitor,  S. TobiesS. Tobies
F. Baader, R. Molitor, S. Tobies
The Guarded Fragment of Conceptual Graphs
Technical Report, LuFG Theoretical Computer Science, RWTH Aachen, volume LTCS-98-10, 1998. LTCS-Report
  • KurzfassungAbstract
    Conceptual graphs (CGs) are an expressive and intuitive formalism, which plays

    an important role in the area of knowledge representation. Due to their expressiveness, most interesting problems for CGs are inherently undecidable. We identify the syntactically defined guarded fragment of CGs, for which both

    subsumption and validity is decidable in deterministic exponential time.
  • Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ Baader-Molitor-Tobies-LTCS-98a,
  address = {Germany},
  author = {F. {Baader} and R. {Molitor} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
  number = {LTCS-98-10},
  title = {The Guarded Fragment of Conceptual Graphs},
  type = {LTCS-Report},
  year = {1998},
}