Parsing as non-Horn deduction

DOI10.1016/0004-3702(93)90018-7zbMATH Open0809.68080OpenAlexW2089338354MaRDI QIDQ688151FDOQ688151

Authors: 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

Recommendations

• A formal grammatical model of the resolution method for the propositional calculus
• scientific article; zbMATH DE number 1292286
• scientific article; zbMATH DE number 4092826
• scientific article; zbMATH DE number 1090102
• Negation and minimality in disjunctive databases
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• Intelligent Backtracking in Plan-Based Deduction
• My work with Victor Marek: a mathematician looks at answer set programming
• scientific article; zbMATH DE number 1200168
• An overview of nonmonotonic reasoning and logic programming

zbMATH Keywords

Horn clauselogic programming techniques

Mathematics Subject Classification ID

Artificial intelligence (68T99) Theory of compilers and interpreters (68N20) Natural language processing (68T50)

Cites Work

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

Cited In (7)

• An unrealistic parser
• Title not available (Why is that?)
• Parsing MELL proof nets
• Non-Horn clause logic programming
• Parsing with derivatives
• Deduction in non-Horn databases
• Applying SLD-Resolution to a Class of Non-Horn Logic Programs

Uses Software

• Hornlog

This page was built for publication: Parsing as non-Horn deduction

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