Parsing as non-Horn deduction

DOI10.1016/0004-3702(93)90018-7zbMath0809.68080MaRDI QIDQ688151

Edward P. jun. Stabler

Publication date: 20 December 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90018-7

zbMATH Keywords

Horn clause; logic programming techniques

Mathematics Subject Classification ID

68N20: Theory of compilers and interpreters

68T99: Artificial intelligence

68T50: Natural language processing

Uses Software

• Hornlog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-Horn prolog and beyond
• Inferring negative information from disjunctive databases
• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• Semantics of Horn and disjunctive logic programs
• The logic of constraint satisfaction
• Consistency in networks of relations
• Deduction in non-Horn databases
• Weak generalized closed world assumption
• HORNLOG: A graph-based interpreter for general Horn clauses
• Equality and Domain Closure in First-Order Databases
• Extracting Information from Logical Proofs
• A Machine-Oriented Logic Based on the Resolution Principle
• Automatic Theorem Proving With Renamable and Semantic Resolution
• Theorem-Proving for Computers: Some Results on Resolution and Renaming