LATPub622: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Marcel Lippmann (Diskussion | Beiträge)
KKeine Bearbeitungszusammenfassung
 
Marcel Lippmann (Diskussion | Beiträge)
KKeine Bearbeitungszusammenfassung
 
(2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 1: Zeile 1:
{{Publikation Erster Autor
{{Publikation Erster Autor
|ErsterAutorVorname=F.
|ErsterAutorVorname=Franz
|ErsterAutorNachname=Baader
|ErsterAutorNachname=Baader
|FurtherAuthors=R. Molitor; S. Tobies
|FurtherAuthors=R. Molitor; Stephan Tobies
}}
}}
{{Techreport
{{Techreport
Zeile 15: Zeile 15:
}}
}}
{{Publikation Details
{{Publikation Details
|Abstract=Conceptual graphs (CGs) are an expressive and intuitive formalism, which plays
|Abstract=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.
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.
 
 
|ISBN=
|ISBN=
|ISSN=
|ISSN=
Zeile 40: Zeile 34:
   year = {1998},
   year = {1998},
}
}
}}
}}

Aktuelle Version vom 25. März 2015, 16:34 Uhr

Toggle side column

The Guarded Fragment of Conceptual Graphs

Franz BaaderFranz Baader,  R. MolitorR. Molitor,  Stephan TobiesStephan Tobies
Franz Baader, R. Molitor, Stephan 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},
}