Evaluating search heuristics and optimization techniques in propositional satisfiability

DOI10.1007/3-540-45744-5_26MaRDI QIDQ4539619zbMATH OpenFDO

Authors Enrico Giunchiglia, Massimo Maratea, Armando Tacchella, Davide Zambonin

Publication date 10 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830347

Mathematics Subject Classification ID

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

Recommendations

• AI*IA 2005: Advances in Artificial Intelligence
• Optimizing the computation of heuristics for answer set programming systems
• Heuristic search and pruning in polynomial constraints satisfaction
• Search techniques for SAT-based Boolean optimization
• A comparative runtime analysis of heuristic algorithms for satisfiability problems
• Optimal satisfiability for propositional calculi and constraint satisfaction problems
• Heuristic-based backtracking relaxation for propositional satisfiability
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• scientific article; zbMATH DE number 776082
• Progress in Artificial Intelligence

Cited in

(13)

• Selection of search strategies for solving 3-SAT problems
• Towards an efficient library for SAT: A manifesto
• scientific article; zbMATH DE number 6519724 (Why is no real title available?)
• Evaluation of a Catalytic Search Algorithm
• scientific article; zbMATH DE number 2080337 (Why is no real title available?)
• scientific article; zbMATH DE number 2084763 (Why is no real title available?)
• Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
• Theory and Applications of Satisfiability Testing
• Backjumping for quantified Boolean logic satisfiability
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Answer set programming based on propositional satisfiability
• The SAT-based approach to separation logic
• Heuristic-based backtracking relaxation for propositional satisfiability

Describes a project that uses

Uses Software

• SATO

This page was built for publication: Evaluating search heuristics and optimization techniques in propositional satisfiability

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