An extension to linear resolution with selection function

DOI10.1016/0020-0190(82)90035-7zbMath0477.68100OpenAlexW1998072811MaRDI QIDQ1160497

Guy Zanon, Jack Minker

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

Related Items (11)

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

Cites Work

• Linear resolution with selection function
• A Machine-Oriented Logic Based on the Resolution Principle
• Mechanical Theorem-Proving by Model Elimination
• Two Results on Ordering for Resolution with Merging and Linear Format
• Unnamed Item
• Unnamed Item

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