An evolutionary local search method for incremental satisfiability

DOI10.1007/978-3-540-30210-0_13MaRDI QIDQ5464698zbMATH OpenOpenAlexFDO

Authors Mohamed El Bachir Menai

Publication date 19 August 2005

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

Full work available at URL https://doi.org/10.1007/b100361

zbMATH Keywords

Extremal OptimizationIncremental SatisfiabilitySelf-Organized CriticalityStochastic Local Search

Mathematics Subject Classification ID

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

Recommendations

• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• Local search algorithms for SAT: an empirical evaluation
• Local search algorithms for SAT: an empirical evaluation
• scientific article; zbMATH DE number 5510694
• Evolutionary computing for the satisfiability problem
• scientific article; zbMATH DE number 1941955

Cited in

(5)

• The incremental satisfiability problem for a two conjunctive normal form
• Incremental Algorithms for Local Search from Existential Second-Order Logic
• scientific article; zbMATH DE number 5510694 (Why is no real title available?)
• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• A template approach to producing incremental objective cost functions for local search meta-heuristics

Describes a project that uses

Uses Software

• Mizar

This page was built for publication: An evolutionary local search method for incremental satisfiability

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