Weighting strategy for non-clausal resolution

DOI10.1080/09528130701475617zbMath1146.68452OpenAlexW2065798393MaRDI QIDQ3499018

Zbigniew Stachniak, Anton Belov

Publication date: 19 May 2008

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130701475617

zbMATH Keywords

automated reasoningpropositional satisfiabilitynon-clausal resolution

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Completely non-clausal theorem proving
• The \(Q^*\) algorithm - a search strategy for a deductive question-answering system
• SAT-Based Analysis of Cellular Automata

This page was built for publication: Weighting strategy for non-clausal resolution