Incremental Algorithms for Local Search from Existential Second-Order Logic

DOI10.1007/11564751_7MaRDI QIDQ3524163zbMATH OpenOpenAlexFDO

Authors Magnus Ågren, Pierre Flener, Justin Pearson

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4209573
• Declarative local search for predicate logic
• scientific article; zbMATH DE number 1538058
• A Local Algorithm for Incremental Evaluation of Tabled Logic Programs
• Optimized algorithms for incremental analysis of logic programs
• Artificial Intelligence and Symbolic Computation
• scientific article; zbMATH DE number 1231522

Cited in

(4)

• Design of financial CDO squared transactions using constraint programming
• Local search with a SAT oracle for combinatorial optimization
• Revisiting constraint-directed search
• Generic incremental algorithms for local search

Describes a project that uses

Uses Software

• WSAT(OIP)
• NP-SPEC

This page was built for publication: Incremental Algorithms for Local Search from Existential Second-Order Logic

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