Weighting strategy for non-clausal resolution

DOI10.1080/09528130701475617MaRDI QIDQ3499018zbMATH OpenOpenAlexFDO

Authors 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 reasoningnon-clausal resolutionpropositional satisfiability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 517062
• scientific article; zbMATH DE number 1324442
• Weighted models for higher-order computation
• Publication:4946087
• A new approach for weighted constraint satisfaction
• On the problem of weights in multiple criteria decision making (the noncompensatory approach)
• On resolution strategies with weak factorization
• scientific article; zbMATH DE number 3972659
• A strategy for ordering disjunctives in the resolution method

Cites work

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

Cited in

(3)

• Limited resource strategy in resolution theorem proving
• Pruning search space for weighted first order Horn clause satisfiability
• scientific article; zbMATH DE number 3940761 (Why is no real title available?)

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

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