An extension to linear resolution with selection function

DOI10.1016/0020-0190(82)90035-7MaRDI QIDQ1160497zbMATH OpenOpenAlexFDO

Authors Jack Minker, Guy Zanon

Publication date 1982

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(82)90035-7

Mathematics Subject Classification ID

Cites work

• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• Linear resolution with selection function
• Mechanical Theorem-Proving by Model Elimination
• Two Results on Ordering for Resolution with Merging and Linear Format

Cited in

(11)

• Semantics of Horn and disjunctive logic programs
• Clause trees: A tool for understanding and implementing resolution in automated reasoning
• Near-Horn Prolog and the ancestry family of procedures
• Weak generalized closed world assumption
• Jack Minker --- A profile
• Subsumption-linear Q-resolution for QBF theorem proving
• Complexity analysis of propositional resolution with autarky pruning
• Another look at graph coloring via propositional satisfiability
• Generalized disjunctive well-founded semantics for logic programs.
• Closed world assumption for disjunctive reasoning
• Complexity results for answer set programming with bounded predicate arities and implications

This page was built for publication: An extension to linear resolution with selection function

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