scientific article; zbMATH DE number 1931668

MaRDI QIDQ4708926zbMATH OpenFDO

Authors Enrico Giunchiglia, Marco Maratea, Armando Tacchella

Publication date 20 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2424/24240296.htm

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• Progress in Artificial Intelligence
• Heuristic-based backtracking relaxation for propositional satisfiability
• Theory and Applications of Satisfiability Testing
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• A Computational Study of Satisfiability Algorithms for Propositional Logic

Cited in

(8)

• SAT problems with chains of dependent variables
• Limitations of restricted branching in clause learning
• Backdoors to tractable answer set programming
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• On propositional definability
• Limitations of Restricted Branching in Clause Learning
• scientific article; zbMATH DE number 1946872 (Why is no real title available?)
• Abstract Solvers for Computing Cautious Consequences of ASP programs

Describes a project that uses

Uses Software

• NuSMV

This page was built for publication:

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