Please use this identifier to cite or link to this item: doi:10.22028/D291-24956
Title: A complete axiomatization of a theory with feature and arity constraints
Author(s): Backofen, Rolf
Language: English
Year of Publication: 1994
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1994
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: CFT is a recent constraint system providing records as a logical data structure for logic programming and for natural language processing. It combines the rational tree system as defined for logic programming with the feature tree system as used in natural language processing. The formulae considered in this paper are all first-order-logic formulae over a signature of binary and unary predicates called features and arities, respectively. We establish the theory CFT by means of seven axiom schemes and show its completeness. Our completeness proof exhibits a terminating simplification system deciding validity and satisfiability of possibly quantified record descriptions.
Link to this record: urn:nbn:de:bsz:291-scidok-37346
Series name: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Series volume: 94-35
Date of registration: 30-Jun-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
RR_94_35.pdf331,16 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.