scientific article; zbMATH DE number 1765679
From MaRDI portal
Publication:4539619
Recommendations
- AI*IA 2005: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 1890620
- 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
- scientific article; zbMATH DE number 1759450
- 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)- Towards an efficient library for SAT: A manifesto
- Theory and Applications of Satisfiability Testing
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Heuristic-based backtracking relaxation for propositional satisfiability
- The SAT-based approach to separation logic
- scientific article; zbMATH DE number 6519724 (Why is no real title available?)
- Answer set programming based on propositional satisfiability
- Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
- scientific article; zbMATH DE number 2084763 (Why is no real title available?)
- Selection of search strategies for solving 3-SAT problems
- Evaluation of a Catalytic Search Algorithm
- scientific article; zbMATH DE number 2080337 (Why is no real title available?)
- Backjumping for quantified Boolean logic satisfiability
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 Q4539619)
