scientific article; zbMATH DE number 67840

MaRDI QIDQ4013802zbMATH OpenFDO

Authors

Publication date 27 September 1992

zbMATH Keywords

finite model propertyfirst-order logic fragments describing feature structure languagesnatural language structuresNP-completePSPACE-completeSchönfinkel-Bernays decidable class of formulae

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Logic of natural languages (03B65) Complexity of computation (including implicit computational complexity) (03D15) Logic in artificial intelligence (68T27) Natural language processing (68T50)

Recommendations

• Feature-constraint logics for unification grammars
• A complete and recursive feature theory
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• scientific article; zbMATH DE number 65754
• Regular path expressions in feature logic

Cited in

(12)

• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
• Regular path expressions in feature logic
• Interpreting first-order theories into a logic of records
• scientific article; zbMATH DE number 65754 (Why is no real title available?)
• scientific article; zbMATH DE number 1104366 (Why is no real title available?)
• scientific article; zbMATH DE number 1979744 (Why is no real title available?)
• scientific article; zbMATH DE number 1488208 (Why is no real title available?)
• Interactive Logical Structures
• Regular path expressions in feature logic
• scientific article; zbMATH DE number 5262648 (Why is no real title available?)
• Logic and structure
• A complete and recursive feature theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013802)